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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:10:11,192 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:10:11,194 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:10:11,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:10:11,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:10:11,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:10:11,209 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:10:11,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:10:11,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:10:11,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:10:11,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:10:11,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:10:11,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:10:11,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:10:11,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:10:11,221 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:10:11,222 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:10:11,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:10:11,232 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:10:11,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:10:11,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:10:11,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:10:11,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:10:11,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:10:11,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:10:11,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:10:11,241 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:10:11,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:10:11,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:10:11,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:10:11,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:10:11,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:10:11,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:10:11,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:10:11,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:10:11,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:10:11,247 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-14 16:10:11,270 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:10:11,271 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:10:11,272 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:10:11,272 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:10:11,272 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:10:11,273 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:10:11,273 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:10:11,273 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:10:11,273 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:10:11,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:10:11,274 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:10:11,274 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:10:11,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:10:11,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:10:11,274 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:10:11,275 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:10:11,275 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:10:11,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:10:11,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:10:11,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:10:11,276 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:10:11,276 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:10:11,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:10:11,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:10:11,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:10:11,277 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:10:11,277 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:10:11,277 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:10:11,277 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:10:11,277 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:10:11,278 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:10:11,278 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:10:11,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:10:11,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:10:11,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:10:11,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:10:11,351 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:10:11,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum5_true-unreach-call.i [2018-11-14 16:10:11,415 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de82197/13d3e1b901534fa8b51f54ea0f345219/FLAGc901ae5ef [2018-11-14 16:10:11,863 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:10:11,864 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5_true-unreach-call.i [2018-11-14 16:10:11,871 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de82197/13d3e1b901534fa8b51f54ea0f345219/FLAGc901ae5ef [2018-11-14 16:10:11,885 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6de82197/13d3e1b901534fa8b51f54ea0f345219 [2018-11-14 16:10:11,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:10:11,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:10:11,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:10:11,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:10:11,902 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:10:11,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:10:11" (1/1) ... [2018-11-14 16:10:11,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e323d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:11, skipping insertion in model container [2018-11-14 16:10:11,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:10:11" (1/1) ... [2018-11-14 16:10:11,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:10:11,942 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:10:12,151 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:10:12,164 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:10:12,194 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:10:12,213 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:10:12,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12 WrapperNode [2018-11-14 16:10:12,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:10:12,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:10:12,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:10:12,215 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:10:12,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (1/1) ... [2018-11-14 16:10:12,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:10:12,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:10:12,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:10:12,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:10:12,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (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-14 16:10:12,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:10:12,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:10:12,473 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2018-11-14 16:10:12,473 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:10:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:10:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:10:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2018-11-14 16:10:12,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:10:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:10:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:10:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:10:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:10:12,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:10:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:10:12,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:10:13,070 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:10:13,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:10:13 BoogieIcfgContainer [2018-11-14 16:10:13,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:10:13,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:10:13,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:10:13,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:10:13,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:10:11" (1/3) ... [2018-11-14 16:10:13,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567cc5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:10:13, skipping insertion in model container [2018-11-14 16:10:13,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:10:12" (2/3) ... [2018-11-14 16:10:13,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567cc5c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:10:13, skipping insertion in model container [2018-11-14 16:10:13,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:10:13" (3/3) ... [2018-11-14 16:10:13,078 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum5_true-unreach-call.i [2018-11-14 16:10:13,087 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:10:13,096 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:10:13,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:10:13,145 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:10:13,146 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:10:13,146 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:10:13,146 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:10:13,147 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:10:13,147 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:10:13,147 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:10:13,147 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:10:13,147 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:10:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 16:10:13,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 16:10:13,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:10:13,174 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:10:13,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:10:13,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:10:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 865985591, now seen corresponding path program 1 times [2018-11-14 16:10:13,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:10:13,192 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-14 16:10:13,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:10:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:13,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:10:13,738 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 16:10:13,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {36#true} is VALID [2018-11-14 16:10:13,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 16:10:13,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 16:10:13,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 16:10:13,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2018-11-14 16:10:13,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {36#true} is VALID [2018-11-14 16:10:13,746 INFO L256 TraceCheckUtils]: 7: Hoare triple {36#true} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {36#true} is VALID [2018-11-14 16:10:13,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {36#true} is VALID [2018-11-14 16:10:13,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 16:10:13,748 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:10:13,748 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:10:13,749 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 16:10:13,749 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {37#false} is VALID [2018-11-14 16:10:13,749 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 16:10:13,750 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-14 16:10:13,750 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:10:13,751 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:10:13,751 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:10:13,751 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #68#return; {37#false} is VALID [2018-11-14 16:10:13,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {37#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {37#false} is VALID [2018-11-14 16:10:13,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:10:13,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {37#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {37#false} is VALID [2018-11-14 16:10:13,753 INFO L256 TraceCheckUtils]: 23: Hoare triple {37#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {37#false} is VALID [2018-11-14 16:10:13,753 INFO L273 TraceCheckUtils]: 24: Hoare triple {37#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {37#false} is VALID [2018-11-14 16:10:13,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:10:13,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 16:10:13,754 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:10:13,755 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #70#return; {37#false} is VALID [2018-11-14 16:10:13,755 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {37#false} is VALID [2018-11-14 16:10:13,755 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-14 16:10:13,756 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 16:10:13,763 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-14 16:10:13,764 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:10:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:10:13,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:10:13,779 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:10:13,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:10:13,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:10:13,865 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:13,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:10:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:10:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:10:13,878 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 16:10:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:14,095 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 16:10:14,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:10:14,095 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 16:10:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:10:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:10:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:10:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:10:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:10:14,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 16:10:14,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:14,317 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:10:14,317 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:10:14,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:10:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:10:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 16:10:14,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:10:14,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 16:10:14,493 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:10:14,493 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:10:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:14,499 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:10:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:10:14,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:14,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:14,501 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 16:10:14,501 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 16:10:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:14,507 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 16:10:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:10:14,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:14,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:14,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:10:14,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:10:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 16:10:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 16:10:14,519 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 32 [2018-11-14 16:10:14,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:10:14,520 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 16:10:14,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:10:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 16:10:14,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 16:10:14,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:10:14,524 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:10:14,524 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:10:14,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:10:14,525 INFO L82 PathProgramCache]: Analyzing trace with hash -841061000, now seen corresponding path program 1 times [2018-11-14 16:10:14,526 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:10:14,526 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-14 16:10:14,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:10:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:14,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:10:15,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 16:10:15,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {297#true} is VALID [2018-11-14 16:10:15,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 16:10:15,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 16:10:15,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret11 := main(); {297#true} is VALID [2018-11-14 16:10:15,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {297#true} is VALID [2018-11-14 16:10:15,077 INFO L273 TraceCheckUtils]: 6: Hoare triple {297#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:15,078 INFO L256 TraceCheckUtils]: 7: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {320#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:15,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {320#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {327#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:15,080 INFO L273 TraceCheckUtils]: 9: Hoare triple {327#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {327#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:15,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {327#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:10:15,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:10:15,082 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,082 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {298#false} {320#(bvsgt ~N~0 (_ bv1 32))} #66#return; {298#false} is VALID [2018-11-14 16:10:15,083 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {298#false} is VALID [2018-11-14 16:10:15,083 INFO L256 TraceCheckUtils]: 15: Hoare triple {298#false} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 16:10:15,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-14 16:10:15,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:10:15,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:10:15,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,086 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {298#false} {298#false} #68#return; {298#false} is VALID [2018-11-14 16:10:15,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {298#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {298#false} is VALID [2018-11-14 16:10:15,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {298#false} is VALID [2018-11-14 16:10:15,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {298#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {298#false} is VALID [2018-11-14 16:10:15,087 INFO L256 TraceCheckUtils]: 26: Hoare triple {298#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {298#false} is VALID [2018-11-14 16:10:15,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {298#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {298#false} is VALID [2018-11-14 16:10:15,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 16:10:15,089 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 16:10:15,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 16:10:15,089 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {298#false} {298#false} #70#return; {298#false} is VALID [2018-11-14 16:10:15,090 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-14 16:10:15,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-14 16:10:15,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 16:10:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:10:15,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:10:15,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:10:15,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:10:15,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 16:10:15,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:10:15,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:10:15,193 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-14 16:10:15,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:10:15,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:10:15,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:10:15,194 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-14 16:10:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:15,689 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 16:10:15,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:10:15,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 16:10:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:10:15,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:10:15,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 16:10:15,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:10:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 16:10:15,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-14 16:10:15,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:15,891 INFO L225 Difference]: With dead ends: 49 [2018-11-14 16:10:15,891 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 16:10:15,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:10:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 16:10:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 16:10:15,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:10:15,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 16:10:15,952 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 16:10:15,952 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 16:10:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:15,956 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:10:15,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:10:15,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:15,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:15,957 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 16:10:15,957 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 16:10:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:15,961 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 16:10:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 16:10:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:15,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:15,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:10:15,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:10:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:10:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 16:10:15,966 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 36 [2018-11-14 16:10:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:10:15,966 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 16:10:15,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:10:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 16:10:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:10:15,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:10:15,969 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:10:15,969 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:10:15,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:10:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1624901070, now seen corresponding path program 1 times [2018-11-14 16:10:15,970 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:10:15,970 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-14 16:10:15,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:10:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:16,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:10:16,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 16:10:16,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {573#true} is VALID [2018-11-14 16:10:16,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 16:10:16,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 16:10:16,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 16:10:16,315 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:16,316 INFO L256 TraceCheckUtils]: 7: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:16,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {603#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {613#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {613#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {613#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {613#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:10:16,325 INFO L273 TraceCheckUtils]: 14: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:10:16,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,325 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {574#false} {596#(bvsgt ~N~0 (_ bv1 32))} #66#return; {574#false} is VALID [2018-11-14 16:10:16,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {574#false} is VALID [2018-11-14 16:10:16,326 INFO L256 TraceCheckUtils]: 18: Hoare triple {574#false} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {574#false} is VALID [2018-11-14 16:10:16,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {574#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {574#false} is VALID [2018-11-14 16:10:16,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {574#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {574#false} is VALID [2018-11-14 16:10:16,328 INFO L273 TraceCheckUtils]: 22: Hoare triple {574#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {574#false} is VALID [2018-11-14 16:10:16,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,329 INFO L273 TraceCheckUtils]: 24: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:10:16,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:10:16,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,330 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {574#false} {574#false} #68#return; {574#false} is VALID [2018-11-14 16:10:16,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {574#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {574#false} is VALID [2018-11-14 16:10:16,330 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,330 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 16:10:16,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {574#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {574#false} is VALID [2018-11-14 16:10:16,331 INFO L256 TraceCheckUtils]: 32: Hoare triple {574#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {574#false} is VALID [2018-11-14 16:10:16,331 INFO L273 TraceCheckUtils]: 33: Hoare triple {574#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {574#false} is VALID [2018-11-14 16:10:16,332 INFO L273 TraceCheckUtils]: 34: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,332 INFO L273 TraceCheckUtils]: 35: Hoare triple {574#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {574#false} is VALID [2018-11-14 16:10:16,332 INFO L273 TraceCheckUtils]: 36: Hoare triple {574#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {574#false} is VALID [2018-11-14 16:10:16,333 INFO L273 TraceCheckUtils]: 37: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,333 INFO L273 TraceCheckUtils]: 38: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 16:10:16,333 INFO L273 TraceCheckUtils]: 39: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 16:10:16,333 INFO L273 TraceCheckUtils]: 40: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,334 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {574#false} {574#false} #70#return; {574#false} is VALID [2018-11-14 16:10:16,334 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 16:10:16,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 16:10:16,335 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 16:10:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-14 16:10:16,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:10:16,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 16:10:16,633 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 16:10:16,633 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 16:10:16,634 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {573#true} {574#false} #70#return; {574#false} is VALID [2018-11-14 16:10:16,634 INFO L273 TraceCheckUtils]: 40: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,635 INFO L273 TraceCheckUtils]: 39: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 16:10:16,635 INFO L273 TraceCheckUtils]: 38: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 16:10:16,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,636 INFO L273 TraceCheckUtils]: 36: Hoare triple {573#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {573#true} is VALID [2018-11-14 16:10:16,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {573#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {573#true} is VALID [2018-11-14 16:10:16,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {573#true} is VALID [2018-11-14 16:10:16,637 INFO L256 TraceCheckUtils]: 32: Hoare triple {574#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:10:16,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {574#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {574#false} is VALID [2018-11-14 16:10:16,637 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 16:10:16,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 16:10:16,638 INFO L273 TraceCheckUtils]: 28: Hoare triple {574#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {574#false} is VALID [2018-11-14 16:10:16,638 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {573#true} {574#false} #68#return; {574#false} is VALID [2018-11-14 16:10:16,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 16:10:16,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 16:10:16,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {573#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {573#true} is VALID [2018-11-14 16:10:16,640 INFO L273 TraceCheckUtils]: 21: Hoare triple {573#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {573#true} is VALID [2018-11-14 16:10:16,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {573#true} is VALID [2018-11-14 16:10:16,641 INFO L256 TraceCheckUtils]: 18: Hoare triple {574#false} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:10:16,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {574#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {574#false} is VALID [2018-11-14 16:10:16,663 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {800#(not (bvsgt ~N~0 (_ bv1 32)))} {596#(bvsgt ~N~0 (_ bv1 32))} #66#return; {574#false} is VALID [2018-11-14 16:10:16,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {800#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {800#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,695 INFO L273 TraceCheckUtils]: 13: Hoare triple {810#(or (bvslt mapsum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {800#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:16,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {810#(or (bvslt mapsum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume true; {810#(or (bvslt mapsum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:10:16,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {810#(or (bvslt mapsum_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:10:16,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:10:16,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume true; {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:10:16,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {573#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {817#(or (bvslt (bvadd mapsum_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-14 16:10:16,715 INFO L256 TraceCheckUtils]: 7: Hoare triple {596#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {573#true} is VALID [2018-11-14 16:10:16,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {573#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {596#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:16,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 16:10:16,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 16:10:16,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 16:10:16,717 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 16:10:16,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {573#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {573#true} is VALID [2018-11-14 16:10:16,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 16:10:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-14 16:10:16,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:10:16,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-14 16:10:16,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:10:16,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:10:16,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:10:16,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:16,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:10:16,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:10:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:10:16,892 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-14 16:10:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:17,567 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 16:10:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:10:17,567 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 16:10:17,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:10:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:10:17,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:10:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:10:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 16:10:17,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-14 16:10:17,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:17,751 INFO L225 Difference]: With dead ends: 54 [2018-11-14 16:10:17,751 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 16:10:17,752 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:10:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 16:10:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-14 16:10:17,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:10:17,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-14 16:10:17,783 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-14 16:10:17,783 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-14 16:10:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:17,787 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 16:10:17,787 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 16:10:17,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:17,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:17,788 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-14 16:10:17,788 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-14 16:10:17,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:17,791 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 16:10:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 16:10:17,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:17,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:17,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:10:17,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:10:17,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 16:10:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 16:10:17,796 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2018-11-14 16:10:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:10:17,800 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 16:10:17,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:10:17,800 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 16:10:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 16:10:17,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:10:17,806 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:10:17,806 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:10:17,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:10:17,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1083480632, now seen corresponding path program 2 times [2018-11-14 16:10:17,807 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:10:17,807 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-14 16:10:17,824 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:10:17,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:10:17,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:10:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:17,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:10:18,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 16:10:18,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:10:18,264 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,264 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 16:10:18,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 16:10:18,265 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 16:10:18,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1057#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:18,266 INFO L256 TraceCheckUtils]: 7: Hoare triple {1057#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {1057#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:18,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {1057#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {1064#(and (= (_ bv0 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,272 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(and (= (_ bv1 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1084#(and (= (_ bv2 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {1084#(and (= (_ bv2 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1084#(and (= (_ bv2 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {1084#(and (= (_ bv2 32) mapsum_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,280 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1057#(bvsgt ~N~0 (_ bv1 32))} #66#return; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,282 INFO L256 TraceCheckUtils]: 21: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,285 INFO L273 TraceCheckUtils]: 22: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,286 INFO L273 TraceCheckUtils]: 23: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,287 INFO L273 TraceCheckUtils]: 24: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,287 INFO L273 TraceCheckUtils]: 25: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,288 INFO L273 TraceCheckUtils]: 26: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,293 INFO L273 TraceCheckUtils]: 30: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,295 INFO L273 TraceCheckUtils]: 31: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,297 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #68#return; {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:18,303 INFO L273 TraceCheckUtils]: 34: Hoare triple {1091#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-14 16:10:18,304 INFO L273 TraceCheckUtils]: 35: Hoare triple {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume true; {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-14 16:10:18,305 INFO L273 TraceCheckUtils]: 36: Hoare triple {1146#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1035#false} is VALID [2018-11-14 16:10:18,306 INFO L273 TraceCheckUtils]: 37: Hoare triple {1035#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1035#false} is VALID [2018-11-14 16:10:18,306 INFO L256 TraceCheckUtils]: 38: Hoare triple {1035#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {1035#false} is VALID [2018-11-14 16:10:18,306 INFO L273 TraceCheckUtils]: 39: Hoare triple {1035#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1035#false} is VALID [2018-11-14 16:10:18,306 INFO L273 TraceCheckUtils]: 40: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:10:18,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {1035#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1035#false} is VALID [2018-11-14 16:10:18,307 INFO L273 TraceCheckUtils]: 42: Hoare triple {1035#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1035#false} is VALID [2018-11-14 16:10:18,307 INFO L273 TraceCheckUtils]: 43: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:10:18,307 INFO L273 TraceCheckUtils]: 44: Hoare triple {1035#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1035#false} is VALID [2018-11-14 16:10:18,307 INFO L273 TraceCheckUtils]: 45: Hoare triple {1035#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1035#false} is VALID [2018-11-14 16:10:18,308 INFO L273 TraceCheckUtils]: 46: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:10:18,308 INFO L273 TraceCheckUtils]: 47: Hoare triple {1035#false} assume !~bvslt32(~i~0, ~N~0); {1035#false} is VALID [2018-11-14 16:10:18,308 INFO L273 TraceCheckUtils]: 48: Hoare triple {1035#false} #res := ~ret~0[32:0]; {1035#false} is VALID [2018-11-14 16:10:18,308 INFO L273 TraceCheckUtils]: 49: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 16:10:18,309 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1035#false} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 16:10:18,309 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 16:10:18,309 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 16:10:18,310 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 16:10:18,317 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 53 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-14 16:10:18,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:10:18,725 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 16:10:18,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 16:10:18,726 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 16:10:18,726 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1034#true} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 16:10:18,726 INFO L273 TraceCheckUtils]: 49: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,726 INFO L273 TraceCheckUtils]: 48: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:10:18,727 INFO L273 TraceCheckUtils]: 47: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:10:18,727 INFO L273 TraceCheckUtils]: 46: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,727 INFO L273 TraceCheckUtils]: 44: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L273 TraceCheckUtils]: 43: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L273 TraceCheckUtils]: 42: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L273 TraceCheckUtils]: 41: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L273 TraceCheckUtils]: 40: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:10:18,728 INFO L256 TraceCheckUtils]: 38: Hoare triple {1035#false} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:10:18,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {1035#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1035#false} is VALID [2018-11-14 16:10:18,730 INFO L273 TraceCheckUtils]: 36: Hoare triple {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1035#false} is VALID [2018-11-14 16:10:18,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume true; {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1255#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,735 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1034#true} {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #68#return; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,736 INFO L273 TraceCheckUtils]: 32: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,736 INFO L273 TraceCheckUtils]: 31: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:10:18,736 INFO L273 TraceCheckUtils]: 30: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:10:18,737 INFO L273 TraceCheckUtils]: 29: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,737 INFO L273 TraceCheckUtils]: 28: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,737 INFO L273 TraceCheckUtils]: 27: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,738 INFO L273 TraceCheckUtils]: 26: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,739 INFO L273 TraceCheckUtils]: 23: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,739 INFO L273 TraceCheckUtils]: 22: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:10:18,740 INFO L256 TraceCheckUtils]: 21: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:10:18,741 INFO L273 TraceCheckUtils]: 20: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,743 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1034#true} {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #66#return; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,743 INFO L273 TraceCheckUtils]: 17: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 16:10:18,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 16:10:18,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,744 INFO L273 TraceCheckUtils]: 13: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,744 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {1034#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1034#true} is VALID [2018-11-14 16:10:18,745 INFO L273 TraceCheckUtils]: 10: Hoare triple {1034#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1034#true} is VALID [2018-11-14 16:10:18,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {1034#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:10:18,746 INFO L256 TraceCheckUtils]: 7: Hoare triple {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {1034#true} is VALID [2018-11-14 16:10:18,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {1034#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1262#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-14 16:10:18,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 16:10:18,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 16:10:18,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 16:10:18,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 16:10:18,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {1034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1034#true} is VALID [2018-11-14 16:10:18,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 16:10:18,753 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-14 16:10:18,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:10:18,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-14 16:10:18,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 16:10:18,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:10:18,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:10:18,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:18,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:10:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:10:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:10:18,874 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2018-11-14 16:10:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:20,141 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-14 16:10:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:10:20,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 16:10:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:10:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:10:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 16:10:20,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:10:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 16:10:20,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-14 16:10:20,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:10:20,345 INFO L225 Difference]: With dead ends: 87 [2018-11-14 16:10:20,345 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 16:10:20,346 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:10:20,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 16:10:20,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-14 16:10:20,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:10:20,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 59 states. [2018-11-14 16:10:20,460 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 59 states. [2018-11-14 16:10:20,460 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 59 states. [2018-11-14 16:10:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:20,465 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 16:10:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 16:10:20,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:20,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:20,467 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 65 states. [2018-11-14 16:10:20,467 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 65 states. [2018-11-14 16:10:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:10:20,472 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 16:10:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 16:10:20,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:10:20,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:10:20,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:10:20,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:10:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 16:10:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-11-14 16:10:20,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 54 [2018-11-14 16:10:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:10:20,479 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-14 16:10:20,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:10:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-14 16:10:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 16:10:20,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:10:20,481 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:10:20,482 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:10:20,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:10:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash 434139659, now seen corresponding path program 1 times [2018-11-14 16:10:20,482 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:10:20,482 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-14 16:10:20,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:10:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:10:22,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:10:23,145 INFO L477 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 51 treesize of output 40 [2018-11-14 16:10:23,155 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:10:23,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2018-11-14 16:10:23,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:10:23,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 38 treesize of output 37 [2018-11-14 16:10:23,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:10:23,262 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:23,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:23,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:23,293 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:61, output treesize:35 [2018-11-14 16:10:24,741 INFO L477 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 73 treesize of output 58 [2018-11-14 16:10:24,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:10:24,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 58 treesize of output 60 [2018-11-14 16:10:24,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:10:24,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:24,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:24,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-14 16:10:24,914 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:10:25,266 INFO L477 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 70 treesize of output 59 [2018-11-14 16:10:25,358 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:10:25,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:10:25,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:25,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 59 treesize of output 73 [2018-11-14 16:10:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:10:25,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:25,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:10:25,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:65 [2018-11-14 16:10:25,516 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:10:26,328 INFO L477 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 75 treesize of output 63 [2018-11-14 16:10:26,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:26,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-11-14 16:10:26,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:10:26,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:10:26,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:10:26,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:43 [2018-11-14 16:10:26,449 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:10:26,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2018-11-14 16:10:26,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {1703#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1703#true} is VALID [2018-11-14 16:10:26,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {1703#true} assume true; {1703#true} is VALID [2018-11-14 16:10:26,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1703#true} {1703#true} #62#return; {1703#true} is VALID [2018-11-14 16:10:26,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {1703#true} call #t~ret11 := main(); {1703#true} is VALID [2018-11-14 16:10:26,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {1703#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1703#true} is VALID [2018-11-14 16:10:26,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {1703#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:26,940 INFO L256 TraceCheckUtils]: 7: Hoare triple {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret3 := mapsum(~#x~0.base, ~#x~0.offset); {1730#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-14 16:10:26,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {1730#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1734#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:26,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {1734#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1734#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:26,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {1734#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1741#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:26,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {1741#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1745#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:26,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {1745#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume true; {1745#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:27,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {1745#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1752#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) |mapsum_#in~x.offset|))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {1752#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) |mapsum_#in~x.offset|))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1756#(and (= (_ bv2 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {1756#(and (= (_ bv2 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1756#(and (= (_ bv2 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {1756#(and (= (_ bv2 32) mapsum_~i~0) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,237 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1726#(and (= |main_~#x~0.offset| (_ bv0 32)) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {1774#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {1774#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret3|) (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))} is VALID [2018-11-14 16:10:27,314 INFO L256 TraceCheckUtils]: 21: Hoare triple {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))} call #t~ret6 := mapsum(~#x~0.base, ~#x~0.offset); {1782#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {1782#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1786#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {1786#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1786#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {1786#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1793#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {1793#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1797#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:27,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {1797#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume true; {1797#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:27,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {1797#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (not (bvslt (_ bv2 32) ~N~0)) (= mapsum_~x.base |mapsum_#in~x.base|) (bvsgt ~N~0 (_ bv1 32)) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,621 INFO L273 TraceCheckUtils]: 31: Hoare triple {1763#(and (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~ret~0[32:0]; {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,622 INFO L273 TraceCheckUtils]: 32: Hoare triple {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:27,696 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1767#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {1778#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))} #68#return; {1822#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret6|) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))} is VALID [2018-11-14 16:10:27,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {1822#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret6|) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-14 16:10:27,840 INFO L273 TraceCheckUtils]: 35: Hoare triple {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume true; {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} is VALID [2018-11-14 16:10:29,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {1826#(and (= |main_~#x~0.offset| (_ bv0 32)) (not (bvslt (_ bv2 32) ~N~0)) (= main_~ret2~0 ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= main_~temp~0 (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)))} assume !!~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32));call #t~mem9 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~1))), 4bv32);call write~intINTTYPE4(#t~mem9, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);havoc #t~mem9; {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:29,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post8 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:29,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} assume true; {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:29,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-14 16:10:29,209 INFO L273 TraceCheckUtils]: 40: Hoare triple {1833#(and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret~1) (= |main_~#x~0.offset| (_ bv0 32)) (= (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) (not (bvslt (_ bv2 32) ~N~0)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))) ((_ sign_extend 32) main_~temp~0))) main_~ret2~0) (bvsgt ~N~0 (_ bv1 32)))} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))) (= |main_~#x~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:10:29,210 INFO L256 TraceCheckUtils]: 41: Hoare triple {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))) (= |main_~#x~0.offset| (_ bv0 32)))} call #t~ret10 := mapsum(~#x~0.base, ~#x~0.offset); {1703#true} is VALID [2018-11-14 16:10:29,211 INFO L273 TraceCheckUtils]: 42: Hoare triple {1703#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1853#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|))} is VALID [2018-11-14 16:10:29,212 INFO L273 TraceCheckUtils]: 43: Hoare triple {1853#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|))} assume true; {1853#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|))} is VALID [2018-11-14 16:10:29,213 INFO L273 TraceCheckUtils]: 44: Hoare triple {1853#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 ((_ sign_extend 32) (_ bv0 32))) (= mapsum_~x.base |mapsum_#in~x.base|))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1860#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|))} is VALID [2018-11-14 16:10:29,214 INFO L273 TraceCheckUtils]: 45: Hoare triple {1860#(and (= (_ bv0 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) (bvadd (bvmul (_ bv4 32) mapsum_~i~0) mapsum_~x.offset))) ((_ sign_extend 32) mapsum_~i~0) ((_ sign_extend 32) (_ bv0 32)))) (= mapsum_~x.base |mapsum_#in~x.base|))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1864#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:29,215 INFO L273 TraceCheckUtils]: 46: Hoare triple {1864#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume true; {1864#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} is VALID [2018-11-14 16:10:29,484 INFO L273 TraceCheckUtils]: 47: Hoare triple {1864#(and (= (_ bv1 32) mapsum_~i~0) (= mapsum_~x.offset |mapsum_#in~x.offset|) (= mapsum_~x.base |mapsum_#in~x.base|) (= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| mapsum_~x.base) mapsum_~x.offset)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-14 16:10:29,485 INFO L273 TraceCheckUtils]: 48: Hoare triple {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-14 16:10:29,487 INFO L273 TraceCheckUtils]: 49: Hoare triple {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} assume true; {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-14 16:10:29,487 INFO L273 TraceCheckUtils]: 50: Hoare triple {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} assume !~bvslt32(~i~0, ~N~0); {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-14 16:10:29,625 INFO L273 TraceCheckUtils]: 51: Hoare triple {1871#(= mapsum_~ret~0 (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32)))))} #res := ~ret~0[32:0]; {1884#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|)} is VALID [2018-11-14 16:10:29,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {1884#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|)} assume true; {1884#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|)} is VALID [2018-11-14 16:10:29,687 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {1884#(= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) |mapsum_#in~x.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |mapsum_#in~x.base|) (bvadd |mapsum_#in~x.offset| (_ bv4 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |mapsum_#res|)} {1846#(and (exists ((~N~0 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) |main_~#x~0.offset|)) ((_ sign_extend 32) (select (select |#memory_int| |main_~#x~0.base|) (bvadd |main_~#x~0.offset| (bvmul (_ bv4 32) ~N~0) (_ bv4294967292 32)))) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1))) (= |main_~#x~0.offset| (_ bv0 32)))} #70#return; {1891#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret10|)))} is VALID [2018-11-14 16:10:29,750 INFO L273 TraceCheckUtils]: 54: Hoare triple {1891#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) |main_#t~ret10|)))} ~ret5~0 := #t~ret10;havoc #t~ret10; {1895#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret5~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1)))} is VALID [2018-11-14 16:10:30,231 INFO L273 TraceCheckUtils]: 55: Hoare triple {1895#(exists ((v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32))) (and (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret2~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret5~0) (= ((_ extract 31 0) (bvadd ((_ sign_extend 32) v_arrayElimCell_9) ((_ sign_extend 32) v_arrayElimCell_8) ((_ sign_extend 32) (_ bv1 32)) (bvmul (_ bv2 64) ((_ sign_extend 32) (_ bv0 32))))) main_~ret~1)))} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1704#false} is VALID [2018-11-14 16:10:30,231 INFO L273 TraceCheckUtils]: 56: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2018-11-14 16:10:30,258 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 6 proven. 92 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 16:10:30,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:10:46,149 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-14 16:10:49,157 WARN L179 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-14 16:10:50,033 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-14 16:10:51,250 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-14 16:10:53,700 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 16:10:56,726 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 16:10:56,860 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 16:10:57,040 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 16:10:57,329 INFO L477 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 159 treesize of output 127 [2018-11-14 16:10:57,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:57,413 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:57,415 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 104 [2018-11-14 16:10:58,092 WARN L179 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-14 16:10:58,161 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:58,180 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:58,182 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 82 [2018-11-14 16:10:58,274 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2018-11-14 16:10:58,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:10:58,746 INFO L477 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 51 treesize of output 36 [2018-11-14 16:10:58,748 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:10:58,761 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:10:58,774 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-14 16:10:58,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:58,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:10:58,817 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-14 16:10:58,817 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:225, output treesize:14 [2018-11-14 16:10:58,830 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:11:03,074 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-14 16:11:04,913 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-14 16:11:06,923 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-14 16:11:08,355 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-14 16:11:08,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 149 [2018-11-14 16:11:08,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:08,572 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 143 [2018-11-14 16:11:08,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:08,753 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:08,811 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:08,856 INFO L303 Elim1Store]: Index analysis took 114 ms [2018-11-14 16:11:09,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 141 treesize of output 180 [2018-11-14 16:11:13,121 WARN L179 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 230 DAG size of output: 209 [2018-11-14 16:11:13,168 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:11:13,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:13,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 124 [2018-11-14 16:11:13,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2018-11-14 16:11:17,545 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2018-11-14 16:11:17,599 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:11:17,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2018-11-14 16:11:17,607 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-14 16:11:17,627 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-14 16:11:17,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:21,687 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:21,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:21,778 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-14 16:11:23,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 157 [2018-11-14 16:11:23,549 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:23,549 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:23,556 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:23,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 143 [2018-11-14 16:11:25,515 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-14 16:11:25,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:25,645 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:25,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:25,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 77 [2018-11-14 16:11:25,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:25,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:26,620 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:26,645 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:26,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:26,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 146 [2018-11-14 16:11:29,456 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-11-14 16:11:29,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,612 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 98 [2018-11-14 16:11:29,662 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:29,712 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 99 [2018-11-14 16:11:29,767 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:29,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,829 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:29,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 118 [2018-11-14 16:11:29,888 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:29,946 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,081 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,105 INFO L303 Elim1Store]: Index analysis took 175 ms [2018-11-14 16:11:30,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 136 [2018-11-14 16:11:30,186 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:30,239 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,285 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 117 [2018-11-14 16:11:30,382 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:30,437 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,442 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,445 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 92 [2018-11-14 16:11:30,525 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:30,668 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,744 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:30,819 INFO L303 Elim1Store]: Index analysis took 180 ms [2018-11-14 16:11:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 117 [2018-11-14 16:11:30,995 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:31,261 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 16:11:34,444 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:34,444 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:34,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:34,452 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:34,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 144 [2018-11-14 16:11:36,550 WARN L179 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-11-14 16:11:36,610 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 94 [2018-11-14 16:11:36,640 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:36,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 138 [2018-11-14 16:11:36,711 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:36,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,765 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,766 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 100 [2018-11-14 16:11:36,790 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:36,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 119 [2018-11-14 16:11:36,867 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:36,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,924 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:36,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 120 [2018-11-14 16:11:36,950 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:37,011 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,012 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,013 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,014 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 119 [2018-11-14 16:11:37,039 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:37,107 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,108 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,108 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:37,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 101 [2018-11-14 16:11:37,129 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:38,079 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 7 xjuncts. [2018-11-14 16:11:40,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:40,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 117 [2018-11-14 16:11:45,339 WARN L179 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-11-14 16:11:45,391 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:45,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 48 [2018-11-14 16:11:45,398 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:45,447 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:46,897 INFO L267 ElimStorePlain]: Start of recursive call 8: 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 10 xjuncts. [2018-11-14 16:11:55,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:55,692 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:55,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 138 [2018-11-14 16:11:55,901 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:55,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:55,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 118 [2018-11-14 16:11:56,382 WARN L179 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-11-14 16:11:56,406 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:56,425 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:56,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-11-14 16:11:56,432 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:56,471 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 16:11:56,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:56,696 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:56,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:11:56,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 148