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-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:05:40,008 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:05:40,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:05:40,021 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:05:40,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:05:40,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:05:40,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:05:40,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:05:40,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:05:40,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:05:40,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:05:40,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:05:40,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:05:40,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:05:40,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:05:40,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:05:40,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:05:40,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:05:40,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:05:40,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:05:40,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:05:40,042 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:05:40,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:05:40,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:05:40,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:05:40,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:05:40,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:05:40,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:05:40,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:05:40,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:05:40,051 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:05:40,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:05:40,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:05:40,052 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:05:40,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:05:40,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:05:40,054 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:05:40,081 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:05:40,082 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:05:40,082 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:05:40,083 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:05:40,083 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:05:40,083 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:05:40,084 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:05:40,084 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:05:40,084 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:05:40,084 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:05:40,085 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:05:40,086 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:05:40,086 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:05:40,086 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:05:40,086 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:05:40,086 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:05:40,087 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:05:40,087 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:05:40,087 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:05:40,087 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:40,087 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:05:40,088 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:05:40,088 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:05:40,088 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:05:40,088 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:05:40,088 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:05:40,089 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:05:40,089 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:05:40,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:05:40,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:05:40,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:05:40,164 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:05:40,165 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:05:40,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:40,234 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdf7fa59/8173dead842f4173aae633ab9b1c8dc0/FLAG98756f599 [2018-11-23 11:05:40,819 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:05:40,820 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:40,833 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdf7fa59/8173dead842f4173aae633ab9b1c8dc0/FLAG98756f599 [2018-11-23 11:05:41,058 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdf7fa59/8173dead842f4173aae633ab9b1c8dc0 [2018-11-23 11:05:41,067 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:05:41,068 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:05:41,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:41,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:05:41,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:05:41,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fb6ee06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41, skipping insertion in model container [2018-11-23 11:05:41,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:05:41,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:05:41,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:41,616 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:05:41,674 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:41,735 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:05:41,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41 WrapperNode [2018-11-23 11:05:41,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:41,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:41,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:05:41,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:05:41,826 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:05:41" (1/1) ... [2018-11-23 11:05:41,850 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:05:41" (1/1) ... [2018-11-23 11:05:41,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:41,861 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:05:41,861 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:05:41,861 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:05:41,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (1/1) ... [2018-11-23 11:05:41,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:05:41,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:05:41,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:05:41,903 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:05:41,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (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:05:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:05:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:05:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:05:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:05:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:05:41,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:05:41,967 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:05:41,968 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:05:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:05:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:05:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:05:41,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:05:41,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:05:42,521 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:05:42,522 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:05:42,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:42 BoogieIcfgContainer [2018-11-23 11:05:42,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:05:42,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:05:42,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:05:42,527 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:05:42,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:05:41" (1/3) ... [2018-11-23 11:05:42,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76eaec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:42, skipping insertion in model container [2018-11-23 11:05:42,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:41" (2/3) ... [2018-11-23 11:05:42,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76eaec46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:42, skipping insertion in model container [2018-11-23 11:05:42,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:42" (3/3) ... [2018-11-23 11:05:42,531 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_built_from_end_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:42,541 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:05:42,549 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:05:42,567 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:05:42,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:05:42,599 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:05:42,599 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:05:42,599 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:05:42,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:05:42,600 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:05:42,600 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:05:42,600 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:05:42,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:05:42,617 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-11-23 11:05:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:05:42,623 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:42,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:42,626 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:42,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:42,633 INFO L82 PathProgramCache]: Analyzing trace with hash 62298475, now seen corresponding path program 1 times [2018-11-23 11:05:42,638 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:42,638 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:05:42,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:42,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:43,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2018-11-23 11:05:43,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {24#true} is VALID [2018-11-23 11:05:43,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2018-11-23 11:05:43,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #54#return; {24#true} is VALID [2018-11-23 11:05:43,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret4 := main(); {24#true} is VALID [2018-11-23 11:05:43,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {44#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:43,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {44#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:43,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {25#false} is VALID [2018-11-23 11:05:43,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {25#false} is VALID [2018-11-23 11:05:43,103 INFO L273 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID [2018-11-23 11:05:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:43,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:05:43,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:05:43,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:43,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:05:43,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:43,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:05:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:05:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:05:43,232 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-11-23 11:05:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:43,507 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2018-11-23 11:05:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:05:43,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:05:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:05:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 11:05:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:05:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 11:05:43,526 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 11:05:43,783 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:43,795 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:05:43,795 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:05:43,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:05:43,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:05:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-23 11:05:43,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:43,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 15 states. [2018-11-23 11:05:43,850 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 15 states. [2018-11-23 11:05:43,850 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 15 states. [2018-11-23 11:05:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:43,853 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:05:43,854 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:43,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:43,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:43,854 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 17 states. [2018-11-23 11:05:43,854 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 17 states. [2018-11-23 11:05:43,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:43,858 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:05:43,858 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:43,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:43,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:43,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:43,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:05:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 11:05:43,862 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-23 11:05:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:43,863 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 11:05:43,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:05:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:05:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:05:43,864 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:43,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:43,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:43,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1897159224, now seen corresponding path program 1 times [2018-11-23 11:05:43,865 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:43,865 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:05:43,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:43,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:44,161 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 22 treesize of output 19 [2018-11-23 11:05:44,222 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:05:44,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:44,303 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 22 treesize of output 14 [2018-11-23 11:05:44,307 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,342 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2018-11-23 11:05:44,491 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:05:44,558 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:05:44,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,655 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:05:44,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:05:44,669 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:44,669 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= .cse0 |main_#t~mem2|) (= (_ bv1 32) .cse0))) [2018-11-23 11:05:44,670 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) |main_#t~mem2|) [2018-11-23 11:05:44,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 11:05:44,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {156#true} is VALID [2018-11-23 11:05:44,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 11:05:44,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #54#return; {156#true} is VALID [2018-11-23 11:05:44,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret4 := main(); {156#true} is VALID [2018-11-23 11:05:44,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {156#true} is VALID [2018-11-23 11:05:44,835 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#true} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {179#(= main_~t~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:44,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {179#(= main_~t~0.offset (_ bv0 32))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {179#(= main_~t~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:44,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {179#(= main_~t~0.offset (_ bv0 32))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {186#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:44,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {186#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {186#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:44,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {186#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {193#(= (_ bv1 32) |main_#t~mem2|)} is VALID [2018-11-23 11:05:44,846 INFO L273 TraceCheckUtils]: 11: Hoare triple {193#(= (_ bv1 32) |main_#t~mem2|)} assume 1bv32 != #t~mem2;havoc #t~mem2; {157#false} is VALID [2018-11-23 11:05:44,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 11:05:44,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:44,849 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:44,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:44,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:05:44,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:05:44,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:44,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:05:44,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:44,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:05:44,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:05:44,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:05:44,888 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-11-23 11:05:45,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:45,448 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:05:45,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:05:45,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:05:45,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:45,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:05:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:05:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:05:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-23 11:05:45,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2018-11-23 11:05:45,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:45,494 INFO L225 Difference]: With dead ends: 22 [2018-11-23 11:05:45,494 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:05:45,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:05:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:05:45,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-11-23 11:05:45,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:45,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 17 states. [2018-11-23 11:05:45,505 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 17 states. [2018-11-23 11:05:45,505 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 17 states. [2018-11-23 11:05:45,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:45,508 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:05:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:05:45,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:45,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:45,509 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 20 states. [2018-11-23 11:05:45,509 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 20 states. [2018-11-23 11:05:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:45,511 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 11:05:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:05:45,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:45,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:45,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:45,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:05:45,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:05:45,515 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:05:45,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:45,515 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:05:45,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:05:45,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:45,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:05:45,516 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:45,516 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:45,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:45,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:45,517 INFO L82 PathProgramCache]: Analyzing trace with hash 800598512, now seen corresponding path program 1 times [2018-11-23 11:05:45,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:45,518 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:05:45,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:45,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:45,718 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 13 treesize of output 10 [2018-11-23 11:05:45,723 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 10 treesize of output 9 [2018-11-23 11:05:45,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:45,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:45,760 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 13 treesize of output 10 [2018-11-23 11:05:45,769 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 10 treesize of output 9 [2018-11-23 11:05:45,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:45,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:45,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:45,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-23 11:05:45,978 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:05:46,002 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:05:46,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,030 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:05:46,044 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:05:46,045 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,048 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,054 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:05:46,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:05:46,059 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:46,060 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_9, |#memory_$Pointer$.base|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_9) (_ bv4 32))) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_9) (_ bv4 32)))) (and (= main_~p~0.offset .cse0) (= .cse1 main_~p~0.base) (= .cse1 (_ bv0 32)) (= (_ bv0 32) .cse0))) [2018-11-23 11:05:46,060 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:05:46,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-23 11:05:46,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {294#true} is VALID [2018-11-23 11:05:46,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-23 11:05:46,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #54#return; {294#true} is VALID [2018-11-23 11:05:46,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret4 := main(); {294#true} is VALID [2018-11-23 11:05:46,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:46,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {318#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:05:46,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {318#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {318#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:05:46,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {318#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:46,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:46,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:46,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:46,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {325#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:46,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {295#false} is VALID [2018-11-23 11:05:46,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {295#false} is VALID [2018-11-23 11:05:46,076 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-23 11:05:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:46,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:47,320 INFO L273 TraceCheckUtils]: 15: Hoare triple {295#false} assume !false; {295#false} is VALID [2018-11-23 11:05:47,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {295#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {295#false} is VALID [2018-11-23 11:05:47,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {295#false} is VALID [2018-11-23 11:05:47,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:47,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:47,334 INFO L273 TraceCheckUtils]: 10: Hoare triple {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:47,335 INFO L273 TraceCheckUtils]: 9: Hoare triple {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:47,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {356#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:47,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:47,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:47,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {294#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {314#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:47,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {294#true} call #t~ret4 := main(); {294#true} is VALID [2018-11-23 11:05:47,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {294#true} {294#true} #54#return; {294#true} is VALID [2018-11-23 11:05:47,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {294#true} assume true; {294#true} is VALID [2018-11-23 11:05:47,343 INFO L273 TraceCheckUtils]: 1: Hoare triple {294#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {294#true} is VALID [2018-11-23 11:05:47,343 INFO L256 TraceCheckUtils]: 0: Hoare triple {294#true} call ULTIMATE.init(); {294#true} is VALID [2018-11-23 11:05:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:47,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:47,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-23 11:05:47,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:05:47,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:47,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:05:47,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:47,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:05:47,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:05:47,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:47,391 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-23 11:05:47,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:47,729 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:05:47,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:05:47,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:05:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:47,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:05:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:47,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-23 11:05:47,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2018-11-23 11:05:47,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:47,785 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:05:47,786 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:05:47,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:05:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-23 11:05:47,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:47,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2018-11-23 11:05:47,799 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2018-11-23 11:05:47,799 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2018-11-23 11:05:47,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:47,802 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:05:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:05:47,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:47,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:47,803 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2018-11-23 11:05:47,803 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2018-11-23 11:05:47,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:47,805 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 11:05:47,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 11:05:47,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:47,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:47,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:47,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:47,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:05:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:05:47,808 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 11:05:47,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:47,808 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:05:47,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:05:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:05:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:05:47,809 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:47,810 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:47,810 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:47,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1814256893, now seen corresponding path program 2 times [2018-11-23 11:05:47,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:47,811 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:05:47,834 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:05:47,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:05:47,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:05:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:47,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:47,989 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:05:47,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:48,008 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:48,008 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (and (= main_~t~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_13| main_~t~0.base (_ bv1 1)))) [2018-11-23 11:05:48,009 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1))) [2018-11-23 11:05:48,071 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 22 treesize of output 19 [2018-11-23 11:05:48,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:05:48,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:48,105 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 22 treesize of output 14 [2018-11-23 11:05:48,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,140 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-11-23 11:05:48,270 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:48,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:48,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, 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:05:48,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-11-23 11:05:48,396 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:48,406 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 10 treesize of output 9 [2018-11-23 11:05:48,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,485 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:48,493 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 10 treesize of output 9 [2018-11-23 11:05:48,495 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,586 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 32 treesize of output 39 [2018-11-23 11:05:48,599 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:05:48,609 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:48,613 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 22 treesize of output 14 [2018-11-23 11:05:48,616 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,638 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,667 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:65, output treesize:45 [2018-11-23 11:05:50,681 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:50,681 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_10|, v_main_~p~0.base_13, |v_#memory_int_10|, |v_#memory_$Pointer$.offset_10|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_13 main_~p~0.base)) (= (bvadd (select (select |v_#memory_int_10| v_main_~p~0.base_13) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_10| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_10| main_~p~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_10| main_~p~0.base (store (store (select |v_#memory_int_10| main_~p~0.base) main_~p~0.offset (_ bv1 32)) .cse0 (select (select |#memory_int| main_~p~0.base) .cse0))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_10| main_~p~0.base (store (select |v_#memory_$Pointer$.base_10| main_~p~0.base) .cse0 v_main_~p~0.base_13)) |#memory_$Pointer$.base|))) [2018-11-23 11:05:50,682 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse1) (_ bv0 32)) (_ bv4294967295 32))) (not (= .cse1 main_~p~0.base))))) [2018-11-23 11:05:51,008 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:05:51,017 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:05:51,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,049 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 27 treesize of output 21 [2018-11-23 11:05:51,067 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 12 [2018-11-23 11:05:51,069 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:51,095 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:24 [2018-11-23 11:05:51,102 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:51,103 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_14, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_14) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_14) (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_14) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| .cse0) (_ bv0 32))) (= main_~p~0.offset .cse1) (not (= v_main_~p~0.base_14 .cse0)) (= (_ bv0 32) .cse1))) [2018-11-23 11:05:51,103 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_14]. (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_14) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:05:51,181 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 26 treesize of output 24 [2018-11-23 11:05:51,189 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 5 [2018-11-23 11:05:51,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,205 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:05:51,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:5 [2018-11-23 11:05:51,209 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:51,210 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_14]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_14) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= .cse0 |main_#t~mem2|) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_14 main_~p~0.base)))) [2018-11-23 11:05:51,210 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem2| (_ bv4294967295 32))) [2018-11-23 11:05:51,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2018-11-23 11:05:51,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {504#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {504#true} is VALID [2018-11-23 11:05:51,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 11:05:51,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {504#true} {504#true} #54#return; {504#true} is VALID [2018-11-23 11:05:51,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {504#true} call #t~ret4 := main(); {504#true} is VALID [2018-11-23 11:05:51,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {504#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {504#true} is VALID [2018-11-23 11:05:51,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#true} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {527#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:51,233 INFO L273 TraceCheckUtils]: 7: Hoare triple {527#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {527#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:51,236 INFO L273 TraceCheckUtils]: 8: Hoare triple {527#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {534#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:51,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {534#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {538#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:51,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {538#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:51,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {538#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:05:51,243 INFO L273 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:05:51,243 INFO L273 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {552#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem2|) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:05:51,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {552#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem2|) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:05:51,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {545#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {559#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_14) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_14 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:51,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {559#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_14) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_14 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {563#(= (_ bv1 32) |main_#t~mem2|)} is VALID [2018-11-23 11:05:51,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#(= (_ bv1 32) |main_#t~mem2|)} assume 1bv32 != #t~mem2;havoc #t~mem2; {505#false} is VALID [2018-11-23 11:05:51,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {505#false} assume !false; {505#false} is VALID [2018-11-23 11:05:51,254 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:51,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:53,662 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:53,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:53,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:53,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:20 [2018-11-23 11:05:53,746 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:53,746 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_11|]. (let ((.cse1 (select |v_#memory_int_11| main_~t~0.base))) (or (not (= |v_#memory_int_11| (store |#memory_int| main_~t~0.base (let ((.cse0 (bvadd main_~t~0.offset (_ bv4 32)))) (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) .cse0 (select .cse1 .cse0)))))) (not (= (_ bv1 32) (select .cse1 main_~t~0.offset))) (= (_ bv1 32) (select (select |v_#memory_int_11| main_~p~0.base) main_~p~0.offset)))) [2018-11-23 11:05:53,746 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_2]. (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset)) [2018-11-23 11:06:02,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:02,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:02,234 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 28 treesize of output 30 [2018-11-23 11:06:02,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-23 11:06:02,250 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,253 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 18 treesize of output 24 [2018-11-23 11:06:02,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,279 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,303 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 34 treesize of output 32 [2018-11-23 11:06:02,313 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,314 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,315 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,321 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2018-11-23 11:06:02,409 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,409 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,410 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,417 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 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 11:06:02,420 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,474 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,499 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:50, output treesize:13 [2018-11-23 11:06:02,519 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:02,519 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_12|, v_main_~t~0.base_8, v_DerPreprocessor_2, |#memory_int|]. (or (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))) (not (= |v_#memory_int_12| (store |#memory_int| main_~t~0.base (let ((.cse0 (bvadd main_~t~0.offset (_ bv4 32)))) (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) .cse0 (select (select |v_#memory_int_12| main_~t~0.base) .cse0)))))) (= (bvadd (select (select (store |v_#memory_int_12| v_main_~t~0.base_8 (store (store (select |v_#memory_int_12| v_main_~t~0.base_8) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_2)) main_~t~0.base) main_~t~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:06:02,519 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32)))) [2018-11-23 11:06:02,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {505#false} assume !false; {505#false} is VALID [2018-11-23 11:06:02,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {563#(= (_ bv1 32) |main_#t~mem2|)} assume 1bv32 != #t~mem2;havoc #t~mem2; {505#false} is VALID [2018-11-23 11:06:02,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {576#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {563#(= (_ bv1 32) |main_#t~mem2|)} is VALID [2018-11-23 11:06:02,597 INFO L273 TraceCheckUtils]: 15: Hoare triple {580#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {576#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:02,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {584#(or (not (= (_ bv1 32) |main_#t~mem2|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {580#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:02,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {588#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {584#(or (not (= (_ bv1 32) |main_#t~mem2|)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:02,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {588#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {588#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:02,606 INFO L273 TraceCheckUtils]: 11: Hoare triple {595#(forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {588#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:02,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {595#(forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {595#(forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:06:02,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {602#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~t~0.base_8 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))) (= (bvadd (select (select (store |#memory_int| v_main_~t~0.base_8 (store (store (select |#memory_int| v_main_~t~0.base_8) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {595#(forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset)))} is VALID [2018-11-23 11:06:02,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {606#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {602#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (v_main_~t~0.base_8 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_8))) (= (bvadd (select (select (store |#memory_int| v_main_~t~0.base_8 (store (store (select |#memory_int| v_main_~t~0.base_8) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_2)) main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:06:02,616 INFO L273 TraceCheckUtils]: 7: Hoare triple {606#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {606#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:06:02,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#true} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {606#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))))} is VALID [2018-11-23 11:06:02,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {504#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {504#true} is VALID [2018-11-23 11:06:02,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {504#true} call #t~ret4 := main(); {504#true} is VALID [2018-11-23 11:06:02,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {504#true} {504#true} #54#return; {504#true} is VALID [2018-11-23 11:06:02,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {504#true} assume true; {504#true} is VALID [2018-11-23 11:06:02,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {504#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {504#true} is VALID [2018-11-23 11:06:02,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {504#true} call ULTIMATE.init(); {504#true} is VALID [2018-11-23 11:06:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:02,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:02,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-23 11:06:02,623 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:06:02,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:02,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:06:02,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:02,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:06:02,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:06:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=184, Unknown=2, NotChecked=0, Total=240 [2018-11-23 11:06:02,693 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 16 states. [2018-11-23 11:06:05,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,035 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:06:05,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:06:05,035 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:06:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-11-23 11:06:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-11-23 11:06:05,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 29 transitions. [2018-11-23 11:06:05,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:05,105 INFO L225 Difference]: With dead ends: 28 [2018-11-23 11:06:05,105 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:06:05,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=142, Invalid=362, Unknown=2, NotChecked=0, Total=506 [2018-11-23 11:06:05,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:06:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2018-11-23 11:06:05,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:05,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 23 states. [2018-11-23 11:06:05,129 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 23 states. [2018-11-23 11:06:05,129 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 23 states. [2018-11-23 11:06:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,132 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:06:05,132 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:06:05,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:05,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:05,133 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 26 states. [2018-11-23 11:06:05,133 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 26 states. [2018-11-23 11:06:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:05,135 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:06:05,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:06:05,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:05,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:05,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:05,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:06:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 11:06:05,138 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2018-11-23 11:06:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:05,139 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 11:06:05,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:06:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:06:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:06:05,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:05,140 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:05,140 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:05,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:05,141 INFO L82 PathProgramCache]: Analyzing trace with hash 663450891, now seen corresponding path program 3 times [2018-11-23 11:06:05,141 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:05,141 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:06:05,164 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:06:05,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:06:05,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:06:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:05,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:05,319 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:06:05,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 11:06:05,340 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:05,340 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_20|]. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_20| main_~t~0.base (_ bv1 1)))) [2018-11-23 11:06:05,340 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1))) [2018-11-23 11:06:05,480 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 13 treesize of output 10 [2018-11-23 11:06:05,502 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 10 treesize of output 9 [2018-11-23 11:06:05,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,543 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 13 treesize of output 10 [2018-11-23 11:06:05,574 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 10 treesize of output 9 [2018-11-23 11:06:05,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-23 11:06:05,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:05,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:05,769 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:06:05,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-11-23 11:06:05,791 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:05,791 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |v_#valid_21| main_~p~0.base)) (= (_ bv0 1) (select |v_#valid_21| main_~t~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)))) [2018-11-23 11:06:05,791 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)))) [2018-11-23 11:06:05,954 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 23 treesize of output 24 [2018-11-23 11:06:05,964 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 12 treesize of output 1 [2018-11-23 11:06:05,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,094 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 21 treesize of output 22 [2018-11-23 11:06:06,117 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 10 treesize of output 9 [2018-11-23 11:06:06,118 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,258 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 23 treesize of output 30 [2018-11-23 11:06:06,264 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 12 treesize of output 1 [2018-11-23 11:06:06,267 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,327 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 27 treesize of output 34 [2018-11-23 11:06:06,333 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 10 treesize of output 9 [2018-11-23 11:06:06,334 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,347 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,374 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:75, output treesize:46 [2018-11-23 11:06:08,397 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:08,398 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_14|, v_main_~p~0.base_19, |v_#memory_$Pointer$.base_15|, |v_#memory_$Pointer$.offset_14|, |v_#memory_$Pointer$.offset_15|]. (let ((.cse1 (select |v_#memory_$Pointer$.offset_14| main_~p~0.base)) (.cse0 (select |v_#memory_$Pointer$.base_14| main_~p~0.base)) (.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= |v_#memory_$Pointer$.base_14| (store |v_#memory_$Pointer$.base_15| main_~p~0.base (store (select |v_#memory_$Pointer$.base_15| main_~p~0.base) main_~p~0.offset (select .cse0 main_~p~0.offset)))) (= |v_#memory_$Pointer$.offset_14| (store |v_#memory_$Pointer$.offset_15| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_15| main_~p~0.base) main_~p~0.offset (select .cse1 main_~p~0.offset)))) (= (select (select |v_#memory_$Pointer$.base_15| v_main_~p~0.base_19) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_15| v_main_~p~0.base_19) (_ bv4 32))) (not (= v_main_~p~0.base_19 main_~p~0.base)) (= (store |v_#memory_$Pointer$.offset_14| main_~p~0.base (store .cse1 .cse2 (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.base_14| main_~p~0.base (store .cse0 .cse2 v_main_~p~0.base_19)) |#memory_$Pointer$.base|))) [2018-11-23 11:06:08,398 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse1))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32))) (not (= .cse0 main_~p~0.base))))) [2018-11-23 11:06:08,895 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 65 treesize of output 53 [2018-11-23 11:06:08,923 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:08,924 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 17 treesize of output 13 [2018-11-23 11:06:08,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:08,948 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 13 [2018-11-23 11:06:08,950 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:08,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:08,985 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-23 11:06:08,993 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-11-23 11:06:08,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,003 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:06:09,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,007 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,013 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:88, output treesize:7 [2018-11-23 11:06:09,023 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:09,023 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_20, v_main_~p~0.offset_20, |#memory_$Pointer$.offset|]. (let ((.cse5 (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) .cse5)) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) .cse5))) (let ((.cse2 (select |#memory_$Pointer$.offset| .cse1)) (.cse4 (select |#memory_$Pointer$.base| .cse1)) (.cse3 (bvadd .cse0 (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (not (= .cse1 v_main_~p~0.base_20)) (= main_~p~0.offset (select .cse2 .cse3)) (= (_ bv0 32) (select .cse4 (_ bv4 32))) (= (_ bv0 32) (select .cse2 (_ bv4 32))) (= (select .cse4 .cse3) main_~p~0.base))))) [2018-11-23 11:06:09,023 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:06:09,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {764#true} is VALID [2018-11-23 11:06:09,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {764#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {764#true} is VALID [2018-11-23 11:06:09,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {764#true} assume true; {764#true} is VALID [2018-11-23 11:06:09,026 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {764#true} {764#true} #54#return; {764#true} is VALID [2018-11-23 11:06:09,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {764#true} call #t~ret4 := main(); {764#true} is VALID [2018-11-23 11:06:09,035 INFO L273 TraceCheckUtils]: 5: Hoare triple {764#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:06:09,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {788#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:09,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {788#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {788#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:09,040 INFO L273 TraceCheckUtils]: 8: Hoare triple {788#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {795#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)))} is VALID [2018-11-23 11:06:09,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {795#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {799#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:06:09,041 INFO L273 TraceCheckUtils]: 10: Hoare triple {799#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {799#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:06:09,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:09,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:09,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:09,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:09,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:09,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:09,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:09,056 INFO L273 TraceCheckUtils]: 18: Hoare triple {819#(exists ((v_main_~p~0.base_20 (_ BitVec 32)) (v_main_~p~0.offset_20 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) v_main_~p~0.base_20)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.offset) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_20) (bvadd v_main_~p~0.offset_20 (_ bv4 32)))) (_ bv4 32)))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:06:09,064 INFO L273 TraceCheckUtils]: 19: Hoare triple {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {765#false} is VALID [2018-11-23 11:06:09,065 INFO L273 TraceCheckUtils]: 20: Hoare triple {765#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {765#false} is VALID [2018-11-23 11:06:09,065 INFO L273 TraceCheckUtils]: 21: Hoare triple {765#false} assume !false; {765#false} is VALID [2018-11-23 11:06:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:09,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:12,695 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:06:12,717 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:13,032 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,070 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:13,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:13,766 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,792 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,817 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,831 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,858 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,886 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,894 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,905 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,535 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:14,561 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:14,573 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:14,610 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:14,626 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,646 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,057 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,068 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,077 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,091 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,100 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,116 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:15,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-23 11:06:15,388 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 6 variables, input treesize:105, output treesize:122 [2018-11-23 11:06:17,438 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:17,439 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_prenex_3, v_prenex_2, v_prenex_1, |v_#memory_$Pointer$.base_14|, v_main_~p~0.offset_24, |v_#memory_$Pointer$.offset_14|]. (let ((.cse2 (bvadd main_~p~0.offset (_ bv4 32))) (.cse3 (select |#memory_$Pointer$.base| main_~t~0.base)) (.cse0 (select |#memory_$Pointer$.offset| main_~t~0.base))) (and (let ((.cse1 (select v_prenex_3 main_~t~0.base))) (or (not (= v_prenex_3 (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse0 v_prenex_2 (select .cse1 v_prenex_2))))) (= (_ bv0 32) (select (select (store v_prenex_3 main_~t~0.base (store .cse1 (bvadd v_prenex_2 (_ bv4 32)) main_~p~0.offset)) main_~p~0.base) .cse2)) (not (= (store |#memory_$Pointer$.base| main_~t~0.base (store .cse3 v_prenex_2 (select (select v_prenex_1 main_~t~0.base) v_prenex_2))) v_prenex_1)))) (let ((.cse4 (select |v_#memory_$Pointer$.base_14| main_~t~0.base))) (or (= (select (select (store |v_#memory_$Pointer$.base_14| main_~t~0.base (store .cse4 (bvadd v_main_~p~0.offset_24 (_ bv4 32)) main_~p~0.base)) main_~p~0.base) .cse2) (_ bv0 32)) (not (= (store |#memory_$Pointer$.base| main_~t~0.base (store .cse3 v_main_~p~0.offset_24 (select .cse4 v_main_~p~0.offset_24))) |v_#memory_$Pointer$.base_14|)) (not (= |v_#memory_$Pointer$.offset_14| (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse0 v_main_~p~0.offset_24 (select (select |v_#memory_$Pointer$.offset_14| main_~t~0.base) v_main_~p~0.offset_24))))))))) [2018-11-23 11:06:17,439 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_5, v_DerPreprocessor_22, v_main_~p~0.offset_24, v_DerPreprocessor_24, v_prenex_6, v_DerPreprocessor_8, v_prenex_4, v_DerPreprocessor_6, v_prenex_2, v_DerPreprocessor_12]. (let ((.cse0 (= main_~t~0.base main_~p~0.base))) (let ((.cse1 (select |#memory_$Pointer$.base| main_~t~0.base)) (.cse3 (not .cse0)) (.cse5 (= main_~p~0.offset (_ bv0 32))) (.cse4 (select |#memory_$Pointer$.offset| main_~t~0.base)) (.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (and (or .cse0 (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store .cse1 v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) .cse2))) (or .cse3 (= (_ bv0 32) main_~p~0.base)) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store .cse1 v_main_~p~0.offset_24 v_DerPreprocessor_24)) main_~p~0.base) .cse2)) (= main_~p~0.offset v_main_~p~0.offset_24)) (or .cse0 (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse4 v_prenex_6 v_DerPreprocessor_8)) main_~p~0.base) .cse2) (_ bv0 32))) (or .cse5 .cse3) (or .cse5 (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse4 v_prenex_4 v_DerPreprocessor_6)) main_~p~0.base) .cse2))) (or (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse4 v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) .cse2) (_ bv0 32)))))) [2018-11-23 11:06:17,720 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 29 [2018-11-23 11:06:20,003 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:06:22,231 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 47 treesize of output 38 [2018-11-23 11:06:22,316 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 11 treesize of output 10 [2018-11-23 11:06:22,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,380 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:06:22,395 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 8 treesize of output 1 [2018-11-23 11:06:22,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,411 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 20 treesize of output 16 [2018-11-23 11:06:22,419 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 16 treesize of output 3 [2018-11-23 11:06:22,420 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,425 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:22,610 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 44 treesize of output 35 [2018-11-23 11:06:22,687 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 11 treesize of output 10 [2018-11-23 11:06:22,689 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,744 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:06:22,752 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 8 treesize of output 1 [2018-11-23 11:06:22,784 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,865 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,884 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 20 treesize of output 16 [2018-11-23 11:06:22,917 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 16 treesize of output 3 [2018-11-23 11:06:22,918 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,922 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,966 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:23,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-23 11:06:23,137 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:92, output treesize:53 [2018-11-23 11:06:23,154 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:23,154 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_13|, v_main_~t~0.base_10, v_prenex_5, v_DerPreprocessor_22, |v_#memory_$Pointer$.offset_13|, v_prenex_7, v_prenex_2, v_DerPreprocessor_12]. (let ((.cse1 (bvadd main_~t~0.offset (_ bv4 32)))) (and (or (= (_ bv0 32) (select (select (let ((.cse0 (store |v_#memory_$Pointer$.base_13| main_~t~0.base (store (select |v_#memory_$Pointer$.base_13| main_~t~0.base) .cse1 main_~p~0.base)))) (store .cse0 v_main_~t~0.base_10 (store (select .cse0 v_main_~t~0.base_10) v_prenex_5 v_DerPreprocessor_22))) main_~t~0.base) .cse1)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10)))) (or (= main_~t~0.offset v_prenex_2) (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (select (select (let ((.cse2 (store |v_#memory_$Pointer$.offset_13| main_~t~0.base (store (select |v_#memory_$Pointer$.offset_13| main_~t~0.base) .cse1 main_~p~0.offset)))) (store .cse2 v_prenex_7 (store (select .cse2 v_prenex_7) v_prenex_2 v_DerPreprocessor_12))) main_~t~0.base) .cse1) (_ bv0 32))))) [2018-11-23 11:06:23,155 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_8, v_prenex_7, v_prenex_9, v_main_~t~0.base_10]. (let ((.cse0 (= main_~p~0.offset (_ bv0 32))) (.cse1 (= (_ bv0 32) main_~p~0.base))) (and (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (or .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_7)))) (or .cse1 (not (= (_ bv0 1) (select |#valid| v_prenex_8))) (= main_~t~0.base v_prenex_8)) (or .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= main_~t~0.base v_prenex_9)) (or .cse1 (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10)))))) [2018-11-23 11:06:23,310 INFO L273 TraceCheckUtils]: 21: Hoare triple {765#false} assume !false; {765#false} is VALID [2018-11-23 11:06:23,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {765#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {765#false} is VALID [2018-11-23 11:06:23,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {765#false} is VALID [2018-11-23 11:06:23,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:06:23,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,313 INFO L273 TraceCheckUtils]: 16: Hoare triple {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,546 INFO L273 TraceCheckUtils]: 15: Hoare triple {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:06:23,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:23,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:23,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} is VALID [2018-11-23 11:06:25,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {870#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))) (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {857#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} is UNKNOWN [2018-11-23 11:06:25,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {870#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))) (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {870#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))) (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:25,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {877#(and (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~t~0.base_10 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_main_~t~0.base_10 (store (select |#memory_$Pointer$.base| v_main_~t~0.base_10) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))) (forall ((v_prenex_7 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| v_prenex_7 (store (select |#memory_$Pointer$.offset| v_prenex_7) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {870#(and (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))) (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:25,566 INFO L273 TraceCheckUtils]: 8: Hoare triple {881#(and (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= main_~t~0.base v_prenex_9)))) (or (= (_ bv0 32) main_~p~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (or (= main_~t~0.base v_prenex_8) (not (= (_ bv0 1) (select |#valid| v_prenex_8)))))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {877#(and (forall ((v_prenex_5 (_ BitVec 32)) (v_DerPreprocessor_22 (_ BitVec 32)) (v_main_~t~0.base_10 (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_main_~t~0.base_10 (store (select |#memory_$Pointer$.base| v_main_~t~0.base_10) v_prenex_5 v_DerPreprocessor_22)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))) (forall ((v_prenex_7 (_ BitVec 32)) (v_DerPreprocessor_12 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= main_~p~0.offset v_prenex_2) (= (select (select (store |#memory_$Pointer$.offset| v_prenex_7 (store (select |#memory_$Pointer$.offset| v_prenex_7) v_prenex_2 v_DerPreprocessor_12)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))))} is VALID [2018-11-23 11:06:25,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {881#(and (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= main_~t~0.base v_prenex_9)))) (or (= (_ bv0 32) main_~p~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (or (= main_~t~0.base v_prenex_8) (not (= (_ bv0 1) (select |#valid| v_prenex_8)))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {881#(and (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= main_~t~0.base v_prenex_9)))) (or (= (_ bv0 32) main_~p~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (or (= main_~t~0.base v_prenex_8) (not (= (_ bv0 1) (select |#valid| v_prenex_8)))))))} is VALID [2018-11-23 11:06:25,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {881#(and (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= main_~t~0.base v_prenex_9)))) (or (= (_ bv0 32) main_~p~0.base) (forall ((v_prenex_8 (_ BitVec 32))) (or (= main_~t~0.base v_prenex_8) (not (= (_ bv0 1) (select |#valid| v_prenex_8)))))))} is VALID [2018-11-23 11:06:25,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {764#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {784#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:06:25,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {764#true} call #t~ret4 := main(); {764#true} is VALID [2018-11-23 11:06:25,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {764#true} {764#true} #54#return; {764#true} is VALID [2018-11-23 11:06:25,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {764#true} assume true; {764#true} is VALID [2018-11-23 11:06:25,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {764#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {764#true} is VALID [2018-11-23 11:06:25,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {764#true} call ULTIMATE.init(); {764#true} is VALID [2018-11-23 11:06:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 11:06:25,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:06:25,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:25,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:06:26,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:26,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:06:26,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:06:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:06:26,539 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2018-11-23 11:06:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,816 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 11:06:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:06:30,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 11:06:30,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:30,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:06:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 11:06:30,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 11:06:30,883 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:06:30,885 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:06:30,886 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:06:30,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:06:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:06:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 11:06:30,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:30,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 11:06:30,915 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 11:06:30,915 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 11:06:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,918 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:06:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:06:30,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:30,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:30,918 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 11:06:30,919 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 11:06:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,921 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:06:30,921 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:06:30,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:30,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:30,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:30,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:30,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:06:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:06:30,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2018-11-23 11:06:30,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:30,923 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:06:30,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:06:30,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:06:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:06:30,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:30,925 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:30,925 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:30,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1254790568, now seen corresponding path program 4 times [2018-11-23 11:06:30,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:30,926 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:06:30,947 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:06:31,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:06:31,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:06:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:31,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:31,083 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:06:31,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:06:31,104 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:31,104 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= main_~t~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_27| main_~t~0.base (_ bv1 1)))) [2018-11-23 11:06:31,104 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1))) [2018-11-23 11:06:31,137 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 22 treesize of output 19 [2018-11-23 11:06:31,141 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:06:31,149 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:31,152 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 22 treesize of output 14 [2018-11-23 11:06:31,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:16 [2018-11-23 11:06:31,275 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:31,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:31,278 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 17 treesize of output 21 [2018-11-23 11:06:31,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-11-23 11:06:31,309 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:31,309 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_28|]. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |v_#valid_28| main_~p~0.base)) (= (_ bv0 1) (select |v_#valid_28| main_~t~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= |#valid| (store |v_#valid_28| main_~t~0.base (_ bv1 1)))) [2018-11-23 11:06:31,309 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:06:31,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:31,405 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 10 treesize of output 9 [2018-11-23 11:06:31,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,501 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:31,510 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 10 treesize of output 9 [2018-11-23 11:06:31,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,604 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 30 treesize of output 37 [2018-11-23 11:06:31,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 11:06:31,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:31,759 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 22 treesize of output 14 [2018-11-23 11:06:31,785 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,872 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,902 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,970 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:73, output treesize:59 [2018-11-23 11:06:32,073 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:32,074 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_18|, v_main_~p~0.base_27, |v_#memory_int_16|, |v_#memory_$Pointer$.offset_18|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= (select |#valid| v_main_~p~0.base_27) (_ bv1 1)) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_27 main_~p~0.base)) (= (_ bv1 32) (select (select |v_#memory_int_16| v_main_~p~0.base_27) (_ bv0 32))) (= (store |v_#memory_int_16| main_~p~0.base (store (store (select |v_#memory_int_16| main_~p~0.base) main_~p~0.offset (_ bv1 32)) .cse0 (select (select |#memory_int| main_~p~0.base) .cse0))) |#memory_int|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_18| main_~p~0.base (store (select |v_#memory_$Pointer$.base_18| main_~p~0.base) .cse0 v_main_~p~0.base_27))) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (store |v_#memory_$Pointer$.offset_18| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_18| main_~p~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|))) [2018-11-23 11:06:32,074 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv1 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)) (= (_ bv1 1) (select |#valid| .cse1)) (= (select (select |#memory_int| .cse1) (_ bv0 32)) (_ bv1 32)) (not (= .cse1 main_~p~0.base))))) [2018-11-23 11:06:32,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:32,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:32,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:32,189 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 22 treesize of output 25 [2018-11-23 11:06:32,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:64 [2018-11-23 11:06:32,642 INFO L303 Elim1Store]: Index analysis took 214 ms [2018-11-23 11:06:32,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 11:06:32,668 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 12 treesize of output 1 [2018-11-23 11:06:32,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-11-23 11:06:33,146 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 12 treesize of output 1 [2018-11-23 11:06:33,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:06:33,467 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:06:33,468 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:33,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 49 [2018-11-23 11:06:33,634 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 18 treesize of output 16 [2018-11-23 11:06:33,635 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,671 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:33,785 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 60 [2018-11-23 11:06:33,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:06:33,807 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 18 treesize of output 7 [2018-11-23 11:06:33,809 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,816 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,840 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:33,892 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:121, output treesize:87 [2018-11-23 11:06:34,219 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:34,220 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_19|, v_main_~p~0.base_28, |v_#memory_$Pointer$.offset_20|, |v_#memory_int_17|, |v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_19|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_19| main_~p~0.base)) (.cse1 (select (select |v_#memory_$Pointer$.base_20| v_main_~p~0.base_28) (_ bv4 32))) (.cse2 (select |v_#memory_$Pointer$.offset_19| main_~p~0.base))) (and (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_20| v_main_~p~0.base_28) (_ bv4 32))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_19| main_~p~0.base (store .cse0 (_ bv4 32) v_main_~p~0.base_28))) (= (store |v_#memory_int_17| main_~p~0.base (store (store (select |v_#memory_int_17| main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) (select (select |#memory_int| main_~p~0.base) (_ bv4 32)))) |#memory_int|) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_28 main_~p~0.base)) (not (= .cse1 v_main_~p~0.base_28)) (= (_ bv1 32) (select (select |v_#memory_int_17| .cse1) (_ bv0 32))) (= (bvadd (select (select |v_#memory_int_17| v_main_~p~0.base_28) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= |v_#memory_$Pointer$.base_19| (store |v_#memory_$Pointer$.base_20| main_~p~0.base (store (select |v_#memory_$Pointer$.base_20| main_~p~0.base) (_ bv0 32) (select .cse0 (_ bv0 32))))) (not (= .cse1 main_~p~0.base)) (= (store |v_#memory_$Pointer$.offset_19| main_~p~0.base (store .cse2 (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= |v_#memory_$Pointer$.offset_19| (store |v_#memory_$Pointer$.offset_20| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_20| main_~p~0.base) (_ bv0 32) (select .cse2 (_ bv0 32))))))) [2018-11-23 11:06:34,220 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse0) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) (_ bv4 32))) (not (= .cse0 .cse1)) (not (= .cse0 main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32)) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse1) (_ bv0 32)) (_ bv4294967295 32)))))) [2018-11-23 11:06:34,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:34,817 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 53 treesize of output 43 [2018-11-23 11:06:34,826 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 17 [2018-11-23 11:06:34,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:34,863 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:06:34,866 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:34,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:34,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:34,927 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:34,929 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2018-11-23 11:06:34,962 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-11-23 11:06:34,968 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:06:35,009 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 35 treesize of output 29 [2018-11-23 11:06:35,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:35,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:35,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:35,099 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:41 [2018-11-23 11:06:35,115 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:35,115 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_29, |#memory_$Pointer$.offset|]. (let ((.cse5 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32)))) (let ((.cse3 (select |#memory_$Pointer$.base| .cse5)) (.cse4 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)))) (let ((.cse1 (bvadd .cse4 (_ bv4 32))) (.cse0 (select |#memory_$Pointer$.offset| .cse5)) (.cse2 (select .cse3 (_ bv4 32)))) (and (= main_~p~0.offset (select .cse0 .cse1)) (not (= v_main_~p~0.base_29 .cse2)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select .cse3 .cse1) main_~p~0.base) (= (bvadd (select (select |#memory_int| .cse2) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= .cse4 (_ bv0 32)) (= (_ bv0 32) (select .cse0 (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| .cse5) (_ bv0 32))) (not (= .cse2 .cse5)))))) [2018-11-23 11:06:35,115 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_arrayElimCell_48, v_main_~p~0.base_29]. (and (= (_ bv1 32) (select (select |#memory_int| v_arrayElimCell_48) (_ bv0 32))) (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_29 v_arrayElimCell_48)) (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_48))) [2018-11-23 11:06:35,268 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 31 treesize of output 35 [2018-11-23 11:06:35,280 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:06:35,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-11-23 11:06:35,313 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:35,314 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_arrayElimCell_48, v_main_~p~0.base_29]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (_ bv1 32) (select (select |#memory_int| v_arrayElimCell_48) (_ bv0 32))) (not (= v_main_~p~0.base_29 v_arrayElimCell_48)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (= .cse0 |main_#t~mem2|) (= (_ bv1 32) .cse0) (not (= main_~p~0.base v_arrayElimCell_48)))) [2018-11-23 11:06:35,314 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) |main_#t~mem2|) [2018-11-23 11:06:35,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 11:06:35,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1048#true} is VALID [2018-11-23 11:06:35,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 11:06:35,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #54#return; {1048#true} is VALID [2018-11-23 11:06:35,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 11:06:35,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {1048#true} is VALID [2018-11-23 11:06:35,344 INFO L273 TraceCheckUtils]: 6: Hoare triple {1048#true} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1071#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,345 INFO L273 TraceCheckUtils]: 7: Hoare triple {1071#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1071#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,347 INFO L273 TraceCheckUtils]: 8: Hoare triple {1071#(and (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1078#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:35,350 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1082#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {1082#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1082#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,355 INFO L273 TraceCheckUtils]: 11: Hoare triple {1082#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1089#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {1089#(and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1093#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {1093#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1093#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {1093#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~p~0.base)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,369 INFO L273 TraceCheckUtils]: 15: Hoare triple {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,370 INFO L273 TraceCheckUtils]: 16: Hoare triple {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1107#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem2|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1107#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem2|) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {1100#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv0 32))) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} is VALID [2018-11-23 11:06:35,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} is VALID [2018-11-23 11:06:35,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} is VALID [2018-11-23 11:06:35,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {1114#(exists ((v_main_~p~0.base_29 (_ BitVec 32))) (and (not (= v_main_~p~0.base_29 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)))) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_29) (_ bv4 32)) main_~p~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| v_main_~p~0.base_29) (_ bv4 32))))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1124#(and (exists ((v_arrayElimCell_48 (_ BitVec 32)) (v_main_~p~0.base_29 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_arrayElimCell_48) (_ bv0 32))) (not (= v_main_~p~0.base_29 v_arrayElimCell_48)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_48)))) (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) (_ bv0 32))))} is VALID [2018-11-23 11:06:35,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {1124#(and (exists ((v_arrayElimCell_48 (_ BitVec 32)) (v_main_~p~0.base_29 (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| v_arrayElimCell_48) (_ bv0 32))) (not (= v_main_~p~0.base_29 v_arrayElimCell_48)) (= (bvadd (select (select |#memory_int| v_main_~p~0.base_29) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_main_~p~0.base_29 main_~p~0.base)) (not (= main_~p~0.base v_arrayElimCell_48)))) (= main_~p~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~p~0.base) (_ bv0 32))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1128#(= (_ bv1 32) |main_#t~mem2|)} is VALID [2018-11-23 11:06:35,384 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#(= (_ bv1 32) |main_#t~mem2|)} assume 1bv32 != #t~mem2;havoc #t~mem2; {1049#false} is VALID [2018-11-23 11:06:35,384 INFO L273 TraceCheckUtils]: 24: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 11:06:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:35,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:41,043 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-11-23 11:06:41,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,192 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,211 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,328 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:41,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-11-23 11:06:41,396 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:103, output treesize:109 [2018-11-23 11:06:43,566 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:43,567 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_19|, |v_#memory_int_18|, |v_#memory_$Pointer$.offset_19|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_19| main_~t~0.base)) (.cse1 (bvadd main_~t~0.offset (_ bv4 32))) (.cse3 (select |v_#memory_$Pointer$.offset_19| main_~t~0.base)) (.cse4 (select |v_#memory_int_18| main_~t~0.base))) (or (not (= |v_#memory_$Pointer$.base_19| (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset (select .cse0 main_~t~0.offset))))) (= (_ bv1 32) (let ((.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |v_#memory_int_18| (select (select (store |v_#memory_$Pointer$.base_19| main_~t~0.base (store .cse0 .cse1 main_~p~0.base)) main_~p~0.base) .cse2)) (select (select (store |v_#memory_$Pointer$.offset_19| main_~t~0.base (store .cse3 .cse1 main_~p~0.offset)) main_~p~0.base) .cse2)))) (not (= |v_#memory_int_18| (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) .cse1 (select .cse4 .cse1))))) (not (= |v_#memory_$Pointer$.offset_19| (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset (select .cse3 main_~t~0.offset))))) (not (= (_ bv1 32) (select .cse4 main_~t~0.offset))))) [2018-11-23 11:06:43,567 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_10, v_prenex_12, v_prenex_11, v_DerPreprocessor_36, v_DerPreprocessor_38, v_DerPreprocessor_34]. (let ((.cse0 (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32))) (.cse1 (bvadd main_~t~0.offset (_ bv4 32))) (.cse2 (select |#memory_$Pointer$.base| main_~t~0.base)) (.cse4 (select |#memory_$Pointer$.offset| main_~t~0.base)) (.cse3 (bvadd main_~p~0.offset (_ bv4 32)))) (and (or (= main_~p~0.offset main_~t~0.offset) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store .cse0 .cse1 v_prenex_12)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store .cse2 main_~t~0.offset v_prenex_10)) main_~p~0.base) .cse3)) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse4 main_~t~0.offset v_prenex_11)) main_~p~0.base) .cse3)) (_ bv4294967295 32)) (_ bv0 32))) (or (= main_~t~0.base main_~p~0.base) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store .cse0 .cse1 v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store .cse2 main_~t~0.offset v_DerPreprocessor_36)) main_~p~0.base) .cse3)) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store .cse4 main_~t~0.offset v_DerPreprocessor_34)) main_~p~0.base) .cse3)) (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 11:06:43,856 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:07:01,441 WARN L180 SmtUtils]: Spent 4.57 s on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:07:05,048 WARN L180 SmtUtils]: Spent 942.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 11:07:05,122 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:05,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:05,196 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:05,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:05,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:05,443 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:07,740 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 137 treesize of output 128 [2018-11-23 11:07:07,910 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 11:07:07,923 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 11 treesize of output 10 [2018-11-23 11:07:07,925 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,062 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 19 treesize of output 17 [2018-11-23 11:07:08,077 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 8 treesize of output 1 [2018-11-23 11:07:08,078 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,108 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 71 treesize of output 67 [2018-11-23 11:07:08,124 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 67 treesize of output 54 [2018-11-23 11:07:08,126 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,137 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:08,279 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 162 treesize of output 133 [2018-11-23 11:07:08,570 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 11:07:08,581 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 11 treesize of output 10 [2018-11-23 11:07:08,582 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,855 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 19 treesize of output 17 [2018-11-23 11:07:08,864 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 8 treesize of output 1 [2018-11-23 11:07:08,864 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,888 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,901 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 103 treesize of output 97 [2018-11-23 11:07:08,916 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 97 treesize of output 81 [2018-11-23 11:07:08,918 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:08,958 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,163 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:09,216 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 110 treesize of output 101 [2018-11-23 11:07:09,399 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:07:09,408 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 11 treesize of output 10 [2018-11-23 11:07:09,409 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,547 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 45 treesize of output 41 [2018-11-23 11:07:09,576 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 41 treesize of output 28 [2018-11-23 11:07:09,578 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,591 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,625 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 19 treesize of output 17 [2018-11-23 11:07:09,664 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 8 treesize of output 1 [2018-11-23 11:07:09,664 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,688 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:09,806 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:07:12,547 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 106 treesize of output 77 [2018-11-23 11:07:12,684 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2018-11-23 11:07:12,688 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 11 treesize of output 10 [2018-11-23 11:07:12,689 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,729 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 10 treesize of output 8 [2018-11-23 11:07:12,737 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 8 treesize of output 1 [2018-11-23 11:07:12,745 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,748 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,774 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,788 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 79 treesize of output 70 [2018-11-23 11:07:12,901 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 11 treesize of output 10 [2018-11-23 11:07:12,902 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,946 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 17 [2018-11-23 11:07:12,955 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 17 treesize of output 4 [2018-11-23 11:07:12,956 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,962 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:12,996 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,068 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 104 treesize of output 75 [2018-11-23 11:07:13,238 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 11:07:13,243 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 11 treesize of output 10 [2018-11-23 11:07:13,245 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,303 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 48 treesize of output 42 [2018-11-23 11:07:13,314 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 42 treesize of output 26 [2018-11-23 11:07:13,316 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,334 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,370 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,379 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 79 treesize of output 70 [2018-11-23 11:07:13,482 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 11 treesize of output 10 [2018-11-23 11:07:13,484 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,529 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 10 treesize of output 8 [2018-11-23 11:07:13,535 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 8 treesize of output 1 [2018-11-23 11:07:13,536 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,540 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,566 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,587 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 93 treesize of output 84 [2018-11-23 11:07:13,728 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2018-11-23 11:07:13,735 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 11 treesize of output 10 [2018-11-23 11:07:13,736 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,787 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 37 treesize of output 33 [2018-11-23 11:07:13,795 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 20 [2018-11-23 11:07:13,797 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,806 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,843 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:13,855 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 79 treesize of output 70 [2018-11-23 11:07:13,959 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 11 treesize of output 10 [2018-11-23 11:07:13,964 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,003 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 21 treesize of output 17 [2018-11-23 11:07:14,010 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 17 treesize of output 4 [2018-11-23 11:07:14,011 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,016 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,045 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,061 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 104 treesize of output 75 [2018-11-23 11:07:14,214 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-11-23 11:07:14,221 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 11 treesize of output 10 [2018-11-23 11:07:14,223 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,278 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 46 treesize of output 40 [2018-11-23 11:07:14,288 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 40 treesize of output 24 [2018-11-23 11:07:14,291 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,314 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:14,352 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:16,088 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:16,146 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:16,164 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:16,265 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:17,427 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 110 treesize of output 101 [2018-11-23 11:07:17,608 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-23 11:07:17,617 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 11 treesize of output 10 [2018-11-23 11:07:17,619 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:17,678 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 45 treesize of output 41 [2018-11-23 11:07:17,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2018-11-23 11:07:17,692 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:17,703 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:17,741 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:17,761 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 135 treesize of output 126 [2018-11-23 11:07:17,949 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2018-11-23 11:07:17,961 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 11 treesize of output 10 [2018-11-23 11:07:17,962 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:18,040 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 73 treesize of output 69 [2018-11-23 11:07:18,052 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 69 treesize of output 56 [2018-11-23 11:07:18,054 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:18,067 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:18,125 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,164 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 103 treesize of output 74 [2018-11-23 11:07:19,312 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2018-11-23 11:07:19,318 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 11 treesize of output 10 [2018-11-23 11:07:19,320 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,365 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 46 treesize of output 40 [2018-11-23 11:07:19,377 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 40 treesize of output 24 [2018-11-23 11:07:19,379 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,398 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,428 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,441 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 76 treesize of output 67 [2018-11-23 11:07:19,558 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 11 treesize of output 10 [2018-11-23 11:07:19,560 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,603 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 21 treesize of output 17 [2018-11-23 11:07:19,612 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 17 treesize of output 4 [2018-11-23 11:07:19,613 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,618 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:19,652 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:20,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 6 dim-2 vars, End of recursive call: 21 dim-0 vars, and 9 xjuncts. [2018-11-23 11:07:20,471 INFO L202 ElimStorePlain]: Needed 73 recursive calls to eliminate 14 variables, input treesize:243, output treesize:359 [2018-11-23 11:07:20,707 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:20,708 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_prenex_15, v_prenex_13, v_prenex_10, v_prenex_14, v_prenex_12, v_prenex_16, v_prenex_11, |v_#memory_$Pointer$.base_18|, v_main_~t~0.base_13, v_DerPreprocessor_36, |v_#memory_int_19|, v_DerPreprocessor_38, |v_#memory_$Pointer$.offset_18|, v_DerPreprocessor_34]. (let ((.cse0 (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32))) (.cse1 (bvadd main_~t~0.offset (_ bv4 32)))) (and (or (not (= (select |#valid| v_prenex_13) (_ bv0 1))) (not (= v_prenex_14 (store |#memory_int| main_~t~0.base (store .cse0 .cse1 (select (select v_prenex_14 main_~t~0.base) .cse1))))) (= (_ bv0 32) (bvadd (select (select (store v_prenex_14 v_prenex_13 (store (store (select v_prenex_14 v_prenex_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_12)) (select (select (let ((.cse2 (store v_prenex_15 main_~t~0.base (store (select v_prenex_15 main_~t~0.base) .cse1 main_~p~0.base)))) (store .cse2 v_prenex_13 (store (select .cse2 v_prenex_13) (_ bv0 32) v_prenex_10))) main_~t~0.base) .cse1)) (select (select (let ((.cse3 (store v_prenex_16 main_~t~0.base (store (select v_prenex_16 main_~t~0.base) .cse1 main_~p~0.offset)))) (store .cse3 v_prenex_13 (store (select .cse3 v_prenex_13) (_ bv0 32) v_prenex_11))) main_~t~0.base) .cse1)) (_ bv4294967295 32))) (= main_~t~0.offset (_ bv0 32))) (or (not (= |v_#memory_int_19| (store |#memory_int| main_~t~0.base (store .cse0 .cse1 (select (select |v_#memory_int_19| main_~t~0.base) .cse1))))) (= main_~t~0.base v_main_~t~0.base_13) (= (bvadd (select (select (store |v_#memory_int_19| v_main_~t~0.base_13 (store (store (select |v_#memory_int_19| v_main_~t~0.base_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38)) (select (select (let ((.cse4 (store |v_#memory_$Pointer$.base_18| main_~t~0.base (store (select |v_#memory_$Pointer$.base_18| main_~t~0.base) .cse1 main_~p~0.base)))) (store .cse4 v_main_~t~0.base_13 (store (select .cse4 v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_36))) main_~t~0.base) .cse1)) (select (select (let ((.cse5 (store |v_#memory_$Pointer$.offset_18| main_~t~0.base (store (select |v_#memory_$Pointer$.offset_18| main_~t~0.base) .cse1 main_~p~0.offset)))) (store .cse5 v_main_~t~0.base_13 (store (select .cse5 v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_34))) main_~t~0.base) .cse1)) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1)))))) [2018-11-23 11:07:20,708 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_44, v_prenex_13, v_prenex_12, v_prenex_23, v_prenex_10, v_prenex_24, v_DerPreprocessor_46, v_DerPreprocessor_38, v_prenex_18, v_prenex_19, v_prenex_21, v_prenex_22, v_prenex_25, v_prenex_26, v_DerPreprocessor_40, v_prenex_20, v_DerPreprocessor_48, v_main_~t~0.base_13, v_DerPreprocessor_42, v_prenex_17, v_prenex_11]. (let ((.cse2 (= (_ bv4294967292 32) main_~t~0.offset))) (let ((.cse7 (= main_~t~0.base main_~p~0.base)) (.cse8 (not (= (_ bv0 1) (select |#valid| main_~p~0.base)))) (.cse0 (= main_~t~0.offset (_ bv0 32))) (.cse5 (not (= (select |#valid| main_~t~0.base) (_ bv0 1)))) (.cse6 (not .cse2)) (.cse3 (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32))) (.cse4 (bvadd main_~t~0.offset (_ bv4 32)))) (and (let ((.cse1 (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_DerPreprocessor_44)))) (or (not (= (select |#valid| v_prenex_13) (_ bv0 1))) .cse0 (= (bvadd (select (store (store (select .cse1 v_prenex_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_12) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select .cse1 main_~p~0.base) main_~p~0.offset) (_ bv1 32)) .cse2)) (or .cse5 .cse6 (= main_~t~0.base v_prenex_10) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_prenex_23)) v_prenex_10) v_prenex_24) (_ bv4294967295 32)) (_ bv0 32))) (or .cse7 .cse8 (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (or .cse8 .cse0 (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_prenex_18)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_19) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) .cse2) (or .cse7 .cse8 .cse0 (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_prenex_21)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_22) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (or (not (= (select |#valid| v_prenex_26) (_ bv0 1))) .cse0 (= (_ bv0 32) (bvadd (select (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_prenex_25)) main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32))) (= main_~t~0.base v_prenex_26) (= main_~p~0.base v_prenex_26)) (or (not (= (select |#valid| v_prenex_20) (_ bv0 1))) .cse0 (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_DerPreprocessor_40)) main_~p~0.base) main_~p~0.offset)) (= main_~p~0.base v_prenex_20) .cse2) (or (= v_main_~t~0.base_13 main_~p~0.base) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store .cse3 .cse4 v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset))) (or .cse5 .cse6 (= (bvadd (select (store (store (store .cse3 .cse4 v_DerPreprocessor_42) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_17) v_prenex_11) (_ bv4294967295 32)) (_ bv0 32)))))) [2018-11-23 11:08:01,357 WARN L180 SmtUtils]: Spent 40.21 s on a formula simplification. DAG size of input: 154 DAG size of output: 82 [2018-11-23 11:08:23,698 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:08:24,186 WARN L180 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2018-11-23 11:08:24,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:24,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:24,295 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 37 [2018-11-23 11:08:24,301 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-11-23 11:08:24,307 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,310 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:08:24,318 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,318 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,319 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,324 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2018-11-23 11:08:24,398 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,398 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,399 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,405 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 0 case distinctions, treesize of input 25 treesize of output 14 [2018-11-23 11:08:24,407 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,431 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,547 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 58 treesize of output 55 [2018-11-23 11:08:24,556 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:08:24,564 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,568 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 24 treesize of output 30 [2018-11-23 11:08:24,570 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,581 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,607 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,658 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 39 [2018-11-23 11:08:24,663 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,665 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 26 [2018-11-23 11:08:24,720 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:24,721 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 17 treesize of output 3 [2018-11-23 11:08:24,723 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,734 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,751 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:08:24,798 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 10 variables, input treesize:132, output treesize:45 [2018-11-23 11:08:24,839 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:24,840 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_prenex_28, v_prenex_27, v_DerPreprocessor_48, v_prenex_29, v_main_~t~0.base_13, |v_#memory_int_20|, |v_main_#t~malloc1.base_8|, v_DerPreprocessor_46, v_DerPreprocessor_38, |#memory_int|]. (let ((.cse0 (bvadd main_~t~0.offset (_ bv4 32)))) (and (or (= (bvadd (select (select (store v_prenex_28 v_prenex_27 (store (store (select v_prenex_28 v_prenex_27) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_48)) main_~t~0.base) main_~t~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= v_prenex_28 (store v_prenex_29 main_~t~0.base (store (store (select v_prenex_29 main_~t~0.base) main_~t~0.offset (_ bv1 32)) .cse0 (select (select v_prenex_28 main_~t~0.base) .cse0))))) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select (store |#valid| v_prenex_27 (_ bv1 1)) v_main_~t~0.base_13) (_ bv0 1))) (not (= (_ bv0 1) (select |#valid| v_prenex_27))) (= v_main_~t~0.base_13 v_prenex_27)) (or (= main_~t~0.base |v_main_#t~malloc1.base_8|) (not (= |v_#memory_int_20| (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) .cse0 (select (select |v_#memory_int_20| main_~t~0.base) .cse0))))) (not (= (_ bv0 1) (select |#valid| |v_main_#t~malloc1.base_8|))) (= (select (store (store (select (store |v_#memory_int_20| |v_main_#t~malloc1.base_8| (store (store (select |v_#memory_int_20| |v_main_#t~malloc1.base_8|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_46)) main_~t~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~t~0.offset) (_ bv1 32)) (not (= (_ bv0 1) (select (store |#valid| |v_main_#t~malloc1.base_8| (_ bv1 1)) main_~t~0.base)))))) [2018-11-23 11:08:24,840 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~t~0.base_13, |v_main_#t~malloc1.base_8|]. (let ((.cse0 (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))))) (and (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) .cse0 (not (= (_ bv0 1) (select (store |#valid| main_~t~0.base (_ bv1 1)) v_main_~t~0.base_13)))) (or .cse0 (not (= (_ bv0 1) (select |#valid| |v_main_#t~malloc1.base_8|))) (not (= (_ bv0 1) (select (store |#valid| |v_main_#t~malloc1.base_8| (_ bv1 1)) main_~t~0.base)))))) [2018-11-23 11:08:24,990 INFO L273 TraceCheckUtils]: 24: Hoare triple {1049#false} assume !false; {1049#false} is VALID [2018-11-23 11:08:24,991 INFO L273 TraceCheckUtils]: 23: Hoare triple {1128#(= (_ bv1 32) |main_#t~mem2|)} assume 1bv32 != #t~mem2;havoc #t~mem2; {1049#false} is VALID [2018-11-23 11:08:24,992 INFO L273 TraceCheckUtils]: 22: Hoare triple {1141#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1128#(= (_ bv1 32) |main_#t~mem2|)} is VALID [2018-11-23 11:08:24,993 INFO L273 TraceCheckUtils]: 21: Hoare triple {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1141#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:24,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:24,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:24,995 INFO L273 TraceCheckUtils]: 18: Hoare triple {1155#(= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1145#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:24,996 INFO L273 TraceCheckUtils]: 17: Hoare triple {1159#(or (not (= (_ bv1 32) |main_#t~mem2|)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1155#(= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))))} is VALID [2018-11-23 11:08:24,997 INFO L273 TraceCheckUtils]: 16: Hoare triple {1163#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1159#(or (not (= (_ bv1 32) |main_#t~mem2|)) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:08:24,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {1163#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {1163#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:08:27,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {1170#(and (or (= main_~t~0.base main_~p~0.base) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~p~0.offset main_~t~0.offset) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1163#(or (not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv4 32))))))} is UNKNOWN [2018-11-23 11:08:27,006 INFO L273 TraceCheckUtils]: 13: Hoare triple {1170#(and (or (= main_~t~0.base main_~p~0.base) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~p~0.offset main_~t~0.offset) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1170#(and (or (= main_~t~0.base main_~p~0.base) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~p~0.offset main_~t~0.offset) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:08:27,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {1177#(and (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_13) (_ bv0 1))) (= (bvadd (select (select (store |#memory_int| v_prenex_13 (store (store (select |#memory_int| v_prenex_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| v_prenex_13 (store (select |#memory_$Pointer$.base| v_prenex_13) (_ bv0 32) v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| v_prenex_13 (store (select |#memory_$Pointer$.offset| v_prenex_13) (_ bv0 32) v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_main_~t~0.base_13 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= (bvadd (select (select (store |#memory_int| v_main_~t~0.base_13 (store (store (select |#memory_int| v_main_~t~0.base_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| v_main_~t~0.base_13 (store (select |#memory_$Pointer$.base| v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| v_main_~t~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1170#(and (or (= main_~t~0.base main_~p~0.base) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~p~0.offset main_~t~0.offset) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| main_~t~0.base (store (select |#memory_$Pointer$.base| main_~t~0.base) main_~t~0.offset v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| main_~t~0.base (store (select |#memory_$Pointer$.offset| main_~t~0.base) main_~t~0.offset v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:08:27,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {1181#(and (or (= main_~t~0.base main_~p~0.base) (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (forall ((v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))) (forall ((v_DerPreprocessor_48 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset)))) (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (_ bv4294967292 32) main_~t~0.offset))) (or (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_18)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_19) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= main_~p~0.base v_prenex_20) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_40)) main_~p~0.base) main_~p~0.offset)))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1177#(and (or (= main_~p~0.offset (_ bv0 32)) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_13 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_13) (_ bv0 1))) (= (bvadd (select (select (store |#memory_int| v_prenex_13 (store (store (select |#memory_int| v_prenex_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_12)) (select (select (store |#memory_$Pointer$.base| v_prenex_13 (store (select |#memory_$Pointer$.base| v_prenex_13) (_ bv0 32) v_prenex_10)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| v_prenex_13 (store (select |#memory_$Pointer$.offset| v_prenex_13) (_ bv0 32) v_prenex_11)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32))))) (forall ((v_DerPreprocessor_36 (_ BitVec 32)) (v_DerPreprocessor_34 (_ BitVec 32)) (v_main_~t~0.base_13 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= (bvadd (select (select (store |#memory_int| v_main_~t~0.base_13 (store (store (select |#memory_int| v_main_~t~0.base_13) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38)) (select (select (store |#memory_$Pointer$.base| v_main_~t~0.base_13 (store (select |#memory_$Pointer$.base| v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_36)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select (store |#memory_$Pointer$.offset| v_main_~t~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~t~0.base_13) (_ bv0 32) v_DerPreprocessor_34)) main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))))} is VALID [2018-11-23 11:08:27,171 INFO L273 TraceCheckUtils]: 10: Hoare triple {1181#(and (or (= main_~t~0.base main_~p~0.base) (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (forall ((v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))) (forall ((v_DerPreprocessor_48 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset)))) (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (_ bv4294967292 32) main_~t~0.offset))) (or (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_18)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_19) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= main_~p~0.base v_prenex_20) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_40)) main_~p~0.base) main_~p~0.offset)))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1181#(and (or (= main_~t~0.base main_~p~0.base) (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (forall ((v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))) (forall ((v_DerPreprocessor_48 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset)))) (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (_ bv4294967292 32) main_~t~0.offset))) (or (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_18)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_19) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= main_~p~0.base v_prenex_20) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_40)) main_~p~0.base) main_~p~0.offset)))))} is VALID [2018-11-23 11:08:29,193 INFO L273 TraceCheckUtils]: 9: Hoare triple {1188#(and (forall ((|v_main_#t~malloc1.base_8| (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |#valid| |v_main_#t~malloc1.base_8| (_ bv1 1)) main_~p~0.base))) (not (= (_ bv0 1) (select |#valid| |v_main_#t~malloc1.base_8|))) (= main_~p~0.base |v_main_#t~malloc1.base_8|) (= (_ bv1 32) (select (store (store (select (store |#memory_int| |v_main_#t~malloc1.base_8| (store (store (select |#memory_int| |v_main_#t~malloc1.base_8|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset)))) (forall ((v_prenex_27 (_ BitVec 32)) (v_main_~t~0.base_13 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= (bvadd (select (select (store |#memory_int| v_prenex_27 (store (store (select |#memory_int| v_prenex_27) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (store |#valid| v_prenex_27 (_ bv1 1)) v_main_~t~0.base_13) (_ bv0 1))) (not (= (_ bv0 1) (select |#valid| v_prenex_27))) (= v_main_~t~0.base_13 v_prenex_27))))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1181#(and (or (= main_~t~0.base main_~p~0.base) (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (forall ((v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= main_~t~0.base v_main_~t~0.base_13) (not (= (select |#valid| v_main_~t~0.base_13) (_ bv0 1))))) (forall ((v_DerPreprocessor_48 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset)))) (or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (_ bv4294967292 32) main_~t~0.offset))) (or (not (= (_ bv0 1) (select |#valid| main_~p~0.base))) (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_19 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (= (bvadd (select (store (store (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_prenex_18)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_prenex_19) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (or (= main_~t~0.offset (_ bv0 32)) (forall ((v_prenex_20 (_ BitVec 32))) (or (= main_~p~0.base v_prenex_20) (not (= (select |#valid| v_prenex_20) (_ bv0 1))))) (forall ((v_DerPreprocessor_40 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~t~0.base (store (store (select |#memory_int| main_~t~0.base) main_~t~0.offset (_ bv1 32)) (bvadd main_~t~0.offset (_ bv4 32)) v_DerPreprocessor_40)) main_~p~0.base) main_~p~0.offset)))))} is UNKNOWN [2018-11-23 11:08:29,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {1192#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))) (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (not (= (_ bv0 1) (select (store |#valid| main_~t~0.base (_ bv1 1)) v_main_~t~0.base_13)))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1188#(and (forall ((|v_main_#t~malloc1.base_8| (_ BitVec 32)) (v_DerPreprocessor_46 (_ BitVec 32)) (v_DerPreprocessor_38 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |#valid| |v_main_#t~malloc1.base_8| (_ bv1 1)) main_~p~0.base))) (not (= (_ bv0 1) (select |#valid| |v_main_#t~malloc1.base_8|))) (= main_~p~0.base |v_main_#t~malloc1.base_8|) (= (_ bv1 32) (select (store (store (select (store |#memory_int| |v_main_#t~malloc1.base_8| (store (store (select |#memory_int| |v_main_#t~malloc1.base_8|) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_46)) main_~p~0.base) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_38) main_~p~0.offset)))) (forall ((v_prenex_27 (_ BitVec 32)) (v_main_~t~0.base_13 (_ BitVec 32)) (v_DerPreprocessor_48 (_ BitVec 32))) (or (= v_main_~t~0.base_13 main_~p~0.base) (= (bvadd (select (select (store |#memory_int| v_prenex_27 (store (store (select |#memory_int| v_prenex_27) (_ bv0 32) (_ bv1 32)) (_ bv4 32) v_DerPreprocessor_48)) main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (select (store |#valid| v_prenex_27 (_ bv1 1)) v_main_~t~0.base_13) (_ bv0 1))) (not (= (_ bv0 1) (select |#valid| v_prenex_27))) (= v_main_~t~0.base_13 v_prenex_27))))} is VALID [2018-11-23 11:08:29,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {1192#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))) (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (not (= (_ bv0 1) (select (store |#valid| main_~t~0.base (_ bv1 1)) v_main_~t~0.base_13)))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1192#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))) (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (not (= (_ bv0 1) (select (store |#valid| main_~t~0.base (_ bv1 1)) v_main_~t~0.base_13)))))} is VALID [2018-11-23 11:08:29,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {1048#true} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1192#(or (not (= (select |#valid| main_~t~0.base) (_ bv0 1))) (not (= (bvadd main_~t~0.offset (_ bv4294967292 32)) (_ bv0 32))) (forall ((v_main_~t~0.base_13 (_ BitVec 32))) (not (= (_ bv0 1) (select (store |#valid| main_~t~0.base (_ bv1 1)) v_main_~t~0.base_13)))))} is VALID [2018-11-23 11:08:29,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {1048#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {1048#true} is VALID [2018-11-23 11:08:29,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {1048#true} call #t~ret4 := main(); {1048#true} is VALID [2018-11-23 11:08:29,204 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1048#true} {1048#true} #54#return; {1048#true} is VALID [2018-11-23 11:08:29,204 INFO L273 TraceCheckUtils]: 2: Hoare triple {1048#true} assume true; {1048#true} is VALID [2018-11-23 11:08:29,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {1048#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1048#true} is VALID [2018-11-23 11:08:29,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {1048#true} call ULTIMATE.init(); {1048#true} is VALID [2018-11-23 11:08:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:08:29,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:29,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-11-23 11:08:29,213 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 11:08:29,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:29,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:08:33,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 40 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:33,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:08:33,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:08:33,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=362, Unknown=11, NotChecked=0, Total=462 [2018-11-23 11:08:33,491 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 22 states. [2018-11-23 11:08:35,068 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 52 [2018-11-23 11:08:35,958 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 39 [2018-11-23 11:08:37,112 WARN L180 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 51 [2018-11-23 11:08:37,501 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-11-23 11:08:37,905 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 54 [2018-11-23 11:08:39,017 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 51 [2018-11-23 11:08:39,465 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 53 [2018-11-23 11:08:40,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:40,577 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 11:08:40,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:08:40,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 11:08:40,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:08:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-11-23 11:08:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:08:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 35 transitions. [2018-11-23 11:08:40,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 35 transitions. [2018-11-23 11:08:40,731 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:40,732 INFO L225 Difference]: With dead ends: 34 [2018-11-23 11:08:40,733 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 11:08:40,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 82.7s TimeCoverageRelationStatistics Valid=246, Invalid=735, Unknown=11, NotChecked=0, Total=992 [2018-11-23 11:08:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 11:08:40,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2018-11-23 11:08:40,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:40,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 29 states. [2018-11-23 11:08:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 29 states. [2018-11-23 11:08:40,770 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 29 states. [2018-11-23 11:08:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:40,773 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:08:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:08:40,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:40,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:40,774 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 32 states. [2018-11-23 11:08:40,774 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 32 states. [2018-11-23 11:08:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:40,776 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 11:08:40,776 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 11:08:40,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:40,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:40,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:40,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:08:40,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 11:08:40,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 25 [2018-11-23 11:08:40,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:40,779 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 11:08:40,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:08:40,779 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 11:08:40,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:08:40,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:40,780 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:40,780 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:40,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:40,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1934337488, now seen corresponding path program 5 times [2018-11-23 11:08:40,781 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:40,781 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:08:40,811 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:08:41,012 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 11:08:41,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:41,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:41,155 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:08:41,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 11:08:41,177 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:41,177 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_36|]. (and (= main_~p~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_36| main_~t~0.base (_ bv1 1))) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32))) [2018-11-23 11:08:41,177 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1))) [2018-11-23 11:08:41,226 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 13 treesize of output 10 [2018-11-23 11:08:41,231 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 10 treesize of output 9 [2018-11-23 11:08:41,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,264 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 13 treesize of output 10 [2018-11-23 11:08:41,270 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 10 treesize of output 9 [2018-11-23 11:08:41,274 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,277 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-11-23 11:08:41,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:41,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:41,345 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 17 treesize of output 21 [2018-11-23 11:08:41,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:39 [2018-11-23 11:08:41,383 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:41,383 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_37|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= (_ bv1 1) (select |v_#valid_37| main_~p~0.base)) (= |#valid| (store |v_#valid_37| main_~t~0.base (_ bv1 1))) (= main_~p~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_37| main_~t~0.base)))) [2018-11-23 11:08:41,384 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) .cse0)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) .cse0) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)))) [2018-11-23 11:08:41,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:41,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:41,747 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 23 treesize of output 24 [2018-11-23 11:08:41,756 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 12 treesize of output 1 [2018-11-23 11:08:41,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,871 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:08:41,877 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:08:41,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,975 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 22 treesize of output 23 [2018-11-23 11:08:41,987 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-11-23 11:08:41,999 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 14 treesize of output 15 [2018-11-23 11:08:42,001 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:42,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:42,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:42,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:42,078 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:84, output treesize:57 [2018-11-23 11:08:44,098 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:44,098 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_25|, v_main_~p~0.base_37, |v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_27|]. (let ((.cse0 (select |v_#memory_$Pointer$.offset_25| main_~p~0.base)) (.cse1 (select |v_#memory_$Pointer$.base_25| main_~p~0.base))) (and (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_27| v_main_~p~0.base_37) (_ bv4 32))) (= (store |v_#memory_$Pointer$.offset_25| main_~p~0.base (store .cse0 (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= main_~p~0.offset (_ bv0 32)) (= |v_#memory_$Pointer$.offset_25| (store |v_#memory_$Pointer$.offset_27| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_27| main_~p~0.base) (_ bv0 32) (select .cse0 (_ bv0 32))))) (= (store |v_#memory_$Pointer$.base_25| main_~p~0.base (store .cse1 (_ bv4 32) v_main_~p~0.base_37)) |#memory_$Pointer$.base|) (not (= v_main_~p~0.base_37 main_~p~0.base)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select |#valid| v_main_~p~0.base_37) (_ bv1 1)) (= (store |v_#memory_$Pointer$.base_27| main_~p~0.base (store (select |v_#memory_$Pointer$.base_27| main_~p~0.base) (_ bv0 32) (select .cse1 (_ bv0 32)))) |v_#memory_$Pointer$.base_25|) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_27| v_main_~p~0.base_37) (_ bv4 32))))) [2018-11-23 11:08:44,098 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)) (_ bv0 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:08:44,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:44,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:44,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:44,184 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 22 treesize of output 21 [2018-11-23 11:08:44,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:65, output treesize:56 [2018-11-23 11:08:44,349 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:44,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:44,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 51 [2018-11-23 11:08:44,677 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 12 treesize of output 1 [2018-11-23 11:08:44,677 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:44,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 69 [2018-11-23 11:08:44,850 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-23 11:08:44,865 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 23 treesize of output 23 [2018-11-23 11:08:44,867 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,885 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,918 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:44,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:45,021 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 51 [2018-11-23 11:08:45,065 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:08:45,066 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:45,086 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:45,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:45,122 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:105, output treesize:80 [2018-11-23 11:08:47,130 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:47,131 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_26|, v_main_~p~0.base_38, |v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.offset_26|]. (let ((.cse2 (select |v_#memory_$Pointer$.base_26| main_~p~0.base)) (.cse1 (select |v_#memory_$Pointer$.offset_26| main_~p~0.base)) (.cse0 (select (select |v_#memory_$Pointer$.base_28| v_main_~p~0.base_38) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |v_#memory_$Pointer$.offset_28| .cse0) (_ bv4 32)) (_ bv0 32)) (= |v_#memory_$Pointer$.offset_26| (store |v_#memory_$Pointer$.offset_28| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_28| main_~p~0.base) (_ bv0 32) (select .cse1 (_ bv0 32))))) (= (store |v_#memory_$Pointer$.base_26| main_~p~0.base (store .cse2 (_ bv4 32) v_main_~p~0.base_38)) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_26| (store |v_#memory_$Pointer$.base_28| main_~p~0.base (store (select |v_#memory_$Pointer$.base_28| main_~p~0.base) (_ bv0 32) (select .cse2 (_ bv0 32))))) (not (= v_main_~p~0.base_38 main_~p~0.base)) (= (store |v_#memory_$Pointer$.offset_26| main_~p~0.base (store .cse1 (_ bv4 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.offset_28| v_main_~p~0.base_38) (_ bv4 32))) (= (_ bv0 32) (select (select |v_#memory_$Pointer$.base_28| .cse0) (_ bv4 32))) (not (= v_main_~p~0.base_38 .cse0)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:08:47,131 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= .cse0 .cse1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) (_ bv4 32))) (not (= .cse0 main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) (_ bv4 32)))))) [2018-11-23 11:08:47,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:47,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:47,614 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:47,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:47,631 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 0 case distinctions, treesize of input 108 treesize of output 123 [2018-11-23 11:08:47,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:47,644 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 19 treesize of output 15 [2018-11-23 11:08:47,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,695 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 44 treesize of output 27 [2018-11-23 11:08:47,696 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,722 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 15 [2018-11-23 11:08:47,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:47,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:47,790 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-11-23 11:08:47,812 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:08:47,820 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,834 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-23 11:08:47,836 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,843 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:08:47,844 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,845 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:47,851 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:08:47,851 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:151, output treesize:7 [2018-11-23 11:08:47,866 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:47,866 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (.cse4 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)))) (let ((.cse5 (select |#memory_$Pointer$.offset| .cse4)) (.cse6 (select |#memory_$Pointer$.base| .cse4)) (.cse7 (bvadd .cse0 (_ bv4 32)))) (let ((.cse2 (select .cse6 .cse7)) (.cse3 (bvadd (select .cse5 .cse7) (_ bv4 32))) (.cse1 (select .cse6 (_ bv4 32)))) (and (= (_ bv0 32) .cse0) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse1) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| .cse1) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (= (select (select |#memory_$Pointer$.base| .cse2) .cse3) main_~p~0.base) (not (= .cse4 .cse1)) (not (= v_main_~p~0.base_39 .cse1)) (= (select .cse5 (_ bv4 32)) (_ bv0 32)))))) [2018-11-23 11:08:47,867 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:08:47,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {1382#true} call ULTIMATE.init(); {1382#true} is VALID [2018-11-23 11:08:47,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {1382#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1382#true} is VALID [2018-11-23 11:08:47,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {1382#true} assume true; {1382#true} is VALID [2018-11-23 11:08:47,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1382#true} {1382#true} #54#return; {1382#true} is VALID [2018-11-23 11:08:47,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {1382#true} call #t~ret4 := main(); {1382#true} is VALID [2018-11-23 11:08:47,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {1382#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := 0bv32, 0bv32; {1402#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:08:47,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {1402#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1406#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:08:47,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {1406#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1406#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:08:47,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {1406#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1413#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)))} is VALID [2018-11-23 11:08:47,879 INFO L273 TraceCheckUtils]: 9: Hoare triple {1413#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1417#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:08:47,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {1417#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1417#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:08:47,884 INFO L273 TraceCheckUtils]: 11: Hoare triple {1417#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1424#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:08:47,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {1424#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(0bv32 != #t~nondet0);havoc #t~nondet0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc1.base, #t~malloc1.offset; {1428#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:08:47,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {1428#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1428#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:08:47,891 INFO L273 TraceCheckUtils]: 14: Hoare triple {1428#(and (= main_~p~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~p~0.base)) (= main_~t~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)) (not (= main_~t~0.base (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))))} call write~intINTTYPE4(1bv32, ~t~0.base, ~t~0.offset, 4bv32);call write~$Pointer$(~p~0.base, ~p~0.offset, ~t~0.base, ~bvadd32(4bv32, ~t~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~t~0.base, ~t~0.offset; {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:08:47,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} assume !(0bv32 != #t~nondet0);havoc #t~nondet0; {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:08:47,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:08:47,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} is VALID [2018-11-23 11:08:47,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {1435#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32)) main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:08:47,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:08:47,902 INFO L273 TraceCheckUtils]: 20: Hoare triple {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:08:47,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {1448#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) main_~p~0.base)))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:47,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:47,907 INFO L273 TraceCheckUtils]: 23: Hoare triple {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} assume !(1bv32 != #t~mem2);havoc #t~mem2; {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 11:08:47,911 INFO L273 TraceCheckUtils]: 24: Hoare triple {1458#(exists ((v_main_~p~0.base_39 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32))) (_ bv4 32)) (_ bv0 32)) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32)) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)) (_ bv4 32)))) (not (= v_main_~p~0.base_39 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (_ bv4 32)) (_ bv0 32))))} call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1402#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:08:47,911 INFO L273 TraceCheckUtils]: 25: Hoare triple {1402#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem2 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1383#false} is VALID [2018-11-23 11:08:47,912 INFO L273 TraceCheckUtils]: 26: Hoare triple {1383#false} assume 1bv32 != #t~mem2;havoc #t~mem2; {1383#false} is VALID [2018-11-23 11:08:47,912 INFO L273 TraceCheckUtils]: 27: Hoare triple {1383#false} assume !false; {1383#false} is VALID [2018-11-23 11:08:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:08:47,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:53,524 WARN L180 SmtUtils]: Spent 861.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-23 11:08:53,740 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:53,742 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:08:53,748 INFO L168 Benchmark]: Toolchain (without parser) took 192680.89 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 975.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -654.7 MB). Peak memory consumption was 320.4 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:53,749 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:53,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 667.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:53,749 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.05 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:53,750 INFO L168 Benchmark]: Boogie Preprocessor took 41.01 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:08:53,750 INFO L168 Benchmark]: RCFGBuilder took 620.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:53,750 INFO L168 Benchmark]: TraceAbstraction took 191222.79 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 261.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.5 MB). Peak memory consumption was 353.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:08:53,752 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 667.33 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 124.05 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 713.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -791.6 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.01 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 620.52 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 191222.79 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 261.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 91.5 MB). Peak memory consumption was 353.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...