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-Const.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:00:03,305 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:00:03,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:00:03,324 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:00:03,324 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:00:03,326 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:00:03,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:00:03,337 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:00:03,339 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:00:03,340 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:00:03,341 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:00:03,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:00:03,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:00:03,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:00:03,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:00:03,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:00:03,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:00:03,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:00:03,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:00:03,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:00:03,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:00:03,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:00:03,356 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:00:03,356 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:00:03,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:00:03,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:00:03,359 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:00:03,359 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:00:03,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:00:03,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:00:03,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:00:03,362 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:00:03,362 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:00:03,363 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:00:03,364 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:00:03,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:00:03,365 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:00:03,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:00:03,394 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:00:03,395 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:00:03,396 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:00:03,397 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:00:03,397 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:00:03,397 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:00:03,397 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:00:03,397 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:00:03,399 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:00:03,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:00:03,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:00:03,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:00:03,400 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:00:03,401 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:00:03,401 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:00:03,401 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:00:03,401 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:00:03,401 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:00:03,402 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:00:03,402 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:00:03,402 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:00:03,402 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:00:03,402 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:00:03,404 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:00:03,404 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:00:03,405 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:00:03,405 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:00:03,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:00:03,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:00:03,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:00:03,488 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:00:03,488 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:00:03,489 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 18:00:03,566 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599ef08af/b8b7ecdc5f4346ba9ade3a7f74e5130e/FLAGb88ca3f3c [2018-11-14 18:00:04,046 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:00:04,046 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum5_true-unreach-call.i [2018-11-14 18:00:04,054 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599ef08af/b8b7ecdc5f4346ba9ade3a7f74e5130e/FLAGb88ca3f3c [2018-11-14 18:00:04,073 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599ef08af/b8b7ecdc5f4346ba9ade3a7f74e5130e [2018-11-14 18:00:04,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:00:04,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:00:04,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:00:04,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:00:04,089 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:00:04,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5be08520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04, skipping insertion in model container [2018-11-14 18:00:04,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:00:04,126 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:00:04,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:00:04,351 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:00:04,380 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:00:04,399 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:00:04,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04 WrapperNode [2018-11-14 18:00:04,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:00:04,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:00:04,401 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:00:04,401 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:00:04,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (1/1) ... [2018-11-14 18:00:04,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:00:04,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:00:04,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:00:04,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:00:04,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (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 18:00:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:00:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:00:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2018-11-14 18:00:04,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:00:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:00:04,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:00:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2018-11-14 18:00:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:00:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:00:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:00:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:00:04,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:00:05,262 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:00:05,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:00:05 BoogieIcfgContainer [2018-11-14 18:00:05,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:00:05,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:00:05,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:00:05,268 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:00:05,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:00:04" (1/3) ... [2018-11-14 18:00:05,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da7366d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:00:05, skipping insertion in model container [2018-11-14 18:00:05,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:00:04" (2/3) ... [2018-11-14 18:00:05,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da7366d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:00:05, skipping insertion in model container [2018-11-14 18:00:05,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:00:05" (3/3) ... [2018-11-14 18:00:05,272 INFO L112 eAbstractionObserver]: Analyzing ICFG mapsum5_true-unreach-call.i [2018-11-14 18:00:05,282 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:00:05,291 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:00:05,307 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:00:05,347 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:00:05,348 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:00:05,348 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:00:05,349 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:00:05,349 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:00:05,349 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:00:05,349 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:00:05,349 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:00:05,349 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:00:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 18:00:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 18:00:05,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:05,376 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 18:00:05,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:05,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:05,385 INFO L82 PathProgramCache]: Analyzing trace with hash 865985591, now seen corresponding path program 1 times [2018-11-14 18:00:05,390 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:05,390 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 18:00:05,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:00:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:05,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:05,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 18:00:05,761 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 18:00:05,764 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 18:00:05,765 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #62#return; {36#true} is VALID [2018-11-14 18:00:05,765 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2018-11-14 18:00:05,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2018-11-14 18:00:05,766 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 18:00:05,766 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 18:00:05,766 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 18:00:05,776 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 18:00:05,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 18:00:05,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:00:05,778 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {37#false} {36#true} #66#return; {37#false} is VALID [2018-11-14 18:00:05,778 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 18:00:05,779 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 18:00:05,779 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 18:00:05,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:00:05,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 18:00:05,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:00:05,781 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {37#false} {37#false} #68#return; {37#false} is VALID [2018-11-14 18:00:05,782 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 18:00:05,782 INFO L273 TraceCheckUtils]: 21: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:00:05,782 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 18:00:05,784 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 18:00:05,784 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 18:00:05,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 18:00:05,785 INFO L273 TraceCheckUtils]: 26: Hoare triple {37#false} #res := ~ret~0[32:0]; {37#false} is VALID [2018-11-14 18:00:05,785 INFO L273 TraceCheckUtils]: 27: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 18:00:05,785 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {37#false} {37#false} #70#return; {37#false} is VALID [2018-11-14 18:00:05,787 INFO L273 TraceCheckUtils]: 29: Hoare triple {37#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {37#false} is VALID [2018-11-14 18:00:05,788 INFO L273 TraceCheckUtils]: 30: Hoare triple {37#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {37#false} is VALID [2018-11-14 18:00:05,788 INFO L273 TraceCheckUtils]: 31: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 18:00:05,802 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 18:00:05,802 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 (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 18:00:05,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:00:05,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:00:05,821 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:00:05,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:05,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:00:05,982 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 18:00:05,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:00:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:00:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:00:05,993 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 18:00:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,205 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 18:00:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:00:06,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2018-11-14 18:00:06,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:00:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 18:00:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:00:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 18:00:06,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 18:00:06,473 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 18:00:06,487 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:00:06,487 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 18:00:06,491 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 18:00:06,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 18:00:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-14 18:00:06,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:06,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-14 18:00:06,561 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:00:06,561 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:00:06,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,568 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:00:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:00:06,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:06,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:06,570 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-14 18:00:06,570 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-14 18:00:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:06,575 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-14 18:00:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:00:06,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:06,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:06,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:06,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:00:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-14 18:00:06,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 32 [2018-11-14 18:00:06,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:06,584 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-14 18:00:06,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:00:06,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-14 18:00:06,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:00:06,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:06,587 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 18:00:06,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:06,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash -841061000, now seen corresponding path program 1 times [2018-11-14 18:00:06,588 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:06,589 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 18:00:06,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:00:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:06,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:07,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 18:00:07,277 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 18:00:07,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:00:07,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #62#return; {297#true} is VALID [2018-11-14 18:00:07,278 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret11 := main(); {297#true} is VALID [2018-11-14 18:00:07,278 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {297#true} is VALID [2018-11-14 18:00:07,279 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 18:00:07,280 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 18:00:07,281 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 18:00:07,282 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 18:00:07,283 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 18:00:07,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 18:00:07,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,284 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {298#false} {320#(bvsgt ~N~0 (_ bv1 32))} #66#return; {298#false} is VALID [2018-11-14 18:00:07,284 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 18:00:07,284 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 18:00:07,285 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 18:00:07,285 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,286 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 18:00:07,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 18:00:07,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,287 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {298#false} {298#false} #68#return; {298#false} is VALID [2018-11-14 18:00:07,287 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 18:00:07,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {298#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {298#false} is VALID [2018-11-14 18:00:07,288 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 18:00:07,289 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 18:00:07,289 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 18:00:07,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {298#false} assume !~bvslt32(~i~0, ~N~0); {298#false} is VALID [2018-11-14 18:00:07,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {298#false} #res := ~ret~0[32:0]; {298#false} is VALID [2018-11-14 18:00:07,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:00:07,291 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {298#false} {298#false} #70#return; {298#false} is VALID [2018-11-14 18:00:07,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {298#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {298#false} is VALID [2018-11-14 18:00:07,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {298#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {298#false} is VALID [2018-11-14 18:00:07,292 INFO L273 TraceCheckUtils]: 35: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 18:00:07,295 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 18:00:07,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:00:07,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:00:07,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:00:07,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:00:07,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:07,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:00:07,370 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 18:00:07,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:00:07,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:00:07,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:00:07,371 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-14 18:00:07,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:07,845 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-14 18:00:07,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:00:07,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 18:00:07,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:00:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 18:00:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:00:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2018-11-14 18:00:07,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2018-11-14 18:00:07,997 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 18:00:08,000 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:00:08,000 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:00:08,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:00:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:00:08,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-14 18:00:08,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:08,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-14 18:00:08,021 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-14 18:00:08,021 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-14 18:00:08,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:08,025 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:00:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:00:08,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:08,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:08,027 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-14 18:00:08,027 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-14 18:00:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:08,030 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-14 18:00:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-14 18:00:08,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:08,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:08,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:08,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:08,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:00:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 18:00:08,035 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 36 [2018-11-14 18:00:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:08,036 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 18:00:08,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:00:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 18:00:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:00:08,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:08,038 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 18:00:08,038 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:08,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:08,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1624901070, now seen corresponding path program 1 times [2018-11-14 18:00:08,039 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:08,040 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 18:00:08,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:00:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:08,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:08,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 18:00:08,348 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 18:00:08,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 18:00:08,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 18:00:08,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 18:00:08,351 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 18:00:08,351 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 18:00:08,352 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 18:00:08,356 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 18:00:08,357 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 18:00:08,358 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 18:00:08,360 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 18:00:08,360 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 18:00:08,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 18:00:08,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,361 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {574#false} {596#(bvsgt ~N~0 (_ bv1 32))} #66#return; {574#false} is VALID [2018-11-14 18:00:08,361 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 18:00:08,361 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 18:00:08,362 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 18:00:08,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,363 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 18:00:08,363 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 18:00:08,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 18:00:08,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 18:00:08,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,365 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {574#false} {574#false} #68#return; {574#false} is VALID [2018-11-14 18:00:08,365 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 18:00:08,366 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 18:00:08,366 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 18:00:08,367 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 18:00:08,367 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 18:00:08,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,367 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 18:00:08,368 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 18:00:08,368 INFO L273 TraceCheckUtils]: 37: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,368 INFO L273 TraceCheckUtils]: 38: Hoare triple {574#false} assume !~bvslt32(~i~0, ~N~0); {574#false} is VALID [2018-11-14 18:00:08,369 INFO L273 TraceCheckUtils]: 39: Hoare triple {574#false} #res := ~ret~0[32:0]; {574#false} is VALID [2018-11-14 18:00:08,369 INFO L273 TraceCheckUtils]: 40: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,369 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {574#false} {574#false} #70#return; {574#false} is VALID [2018-11-14 18:00:08,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 18:00:08,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 18:00:08,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 18:00:08,375 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 18:00:08,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:08,763 INFO L273 TraceCheckUtils]: 44: Hoare triple {574#false} assume !false; {574#false} is VALID [2018-11-14 18:00:08,763 INFO L273 TraceCheckUtils]: 43: Hoare triple {574#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {574#false} is VALID [2018-11-14 18:00:08,764 INFO L273 TraceCheckUtils]: 42: Hoare triple {574#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {574#false} is VALID [2018-11-14 18:00:08,764 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {573#true} {574#false} #70#return; {574#false} is VALID [2018-11-14 18:00:08,765 INFO L273 TraceCheckUtils]: 40: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,765 INFO L273 TraceCheckUtils]: 39: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 18:00:08,765 INFO L273 TraceCheckUtils]: 38: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 18:00:08,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,766 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 18:00:08,767 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 18:00:08,767 INFO L273 TraceCheckUtils]: 34: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,767 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 18:00:08,768 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 18:00:08,768 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 18:00:08,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {574#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {574#false} is VALID [2018-11-14 18:00:08,769 INFO L273 TraceCheckUtils]: 29: Hoare triple {574#false} assume true; {574#false} is VALID [2018-11-14 18:00:08,769 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 18:00:08,769 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {573#true} {574#false} #68#return; {574#false} is VALID [2018-11-14 18:00:08,769 INFO L273 TraceCheckUtils]: 26: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,770 INFO L273 TraceCheckUtils]: 25: Hoare triple {573#true} #res := ~ret~0[32:0]; {573#true} is VALID [2018-11-14 18:00:08,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {573#true} assume !~bvslt32(~i~0, ~N~0); {573#true} is VALID [2018-11-14 18:00:08,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,771 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 18:00:08,771 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 18:00:08,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,772 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 18:00:08,772 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 18:00:08,772 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 18:00:08,785 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 18:00:08,786 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 18:00:08,787 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 18:00:08,788 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 18:00:08,788 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 18:00:08,804 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 18:00:08,806 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 18:00:08,806 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 18:00:08,808 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 18:00:08,808 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 18:00:08,808 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 18:00:08,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {573#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {573#true} is VALID [2018-11-14 18:00:08,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {573#true} call #t~ret11 := main(); {573#true} is VALID [2018-11-14 18:00:08,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {573#true} {573#true} #62#return; {573#true} is VALID [2018-11-14 18:00:08,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {573#true} assume true; {573#true} is VALID [2018-11-14 18:00:08,810 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 18:00:08,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {573#true} call ULTIMATE.init(); {573#true} is VALID [2018-11-14 18:00:08,815 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 18:00:08,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:00:08,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-14 18:00:08,825 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 18:00:08,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:08,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:00:09,003 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 18:00:09,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:00:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:00:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:00:09,005 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 8 states. [2018-11-14 18:00:09,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:09,670 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-14 18:00:09,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:00:09,670 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2018-11-14 18:00:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:00:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 18:00:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:00:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2018-11-14 18:00:09,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2018-11-14 18:00:09,857 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 18:00:09,859 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:00:09,859 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:00:09,860 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:00:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:00:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-14 18:00:09,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:09,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2018-11-14 18:00:09,883 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2018-11-14 18:00:09,883 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2018-11-14 18:00:09,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:09,886 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 18:00:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 18:00:09,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:09,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:09,888 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2018-11-14 18:00:09,888 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2018-11-14 18:00:09,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:09,891 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-14 18:00:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-14 18:00:09,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:09,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:09,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:09,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:00:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-14 18:00:09,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 45 [2018-11-14 18:00:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:09,896 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-14 18:00:09,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:00:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-14 18:00:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:00:09,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:09,899 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 18:00:09,899 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:09,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:09,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1083480632, now seen corresponding path program 2 times [2018-11-14 18:00:09,900 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:09,900 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 18:00:09,918 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:00:10,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:00:10,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:00:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:10,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:10,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 18:00:10,366 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 18:00:10,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 18:00:10,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 18:00:10,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 18:00:10,367 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 18:00:10,368 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 18:00:10,369 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 18:00:10,369 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 18:00:10,371 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 18:00:10,372 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 18:00:10,372 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 18:00:10,374 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 18:00:10,375 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 18:00:10,376 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 18:00:10,377 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 18:00:10,384 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 18:00:10,385 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 18:00:10,386 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 18:00:10,387 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 18:00:10,388 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 18:00:10,390 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 18:00:10,391 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 18:00:10,392 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 18:00:10,393 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 18:00:10,393 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 18:00:10,394 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 18:00:10,394 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 18:00:10,395 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 18:00:10,396 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 18:00:10,398 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 18:00:10,399 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 18:00:10,400 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 18:00:10,405 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 18:00:10,406 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 18:00:10,407 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 18:00:10,407 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 18:00:10,408 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 18:00:10,408 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 18:00:10,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 18:00:10,408 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 18:00:10,408 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 18:00:10,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 18:00:10,409 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 18:00:10,410 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 18:00:10,410 INFO L273 TraceCheckUtils]: 46: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 18:00:10,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {1035#false} assume !~bvslt32(~i~0, ~N~0); {1035#false} is VALID [2018-11-14 18:00:10,411 INFO L273 TraceCheckUtils]: 48: Hoare triple {1035#false} #res := ~ret~0[32:0]; {1035#false} is VALID [2018-11-14 18:00:10,411 INFO L273 TraceCheckUtils]: 49: Hoare triple {1035#false} assume true; {1035#false} is VALID [2018-11-14 18:00:10,411 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1035#false} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 18:00:10,412 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 18:00:10,412 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 18:00:10,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 18:00:10,419 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 18:00:10,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:10,753 INFO L273 TraceCheckUtils]: 53: Hoare triple {1035#false} assume !false; {1035#false} is VALID [2018-11-14 18:00:10,753 INFO L273 TraceCheckUtils]: 52: Hoare triple {1035#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1035#false} is VALID [2018-11-14 18:00:10,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {1035#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {1035#false} is VALID [2018-11-14 18:00:10,754 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1034#true} {1035#false} #70#return; {1035#false} is VALID [2018-11-14 18:00:10,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 18:00:10,755 INFO L273 TraceCheckUtils]: 47: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 18:00:10,755 INFO L273 TraceCheckUtils]: 46: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,755 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 18:00:10,755 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 18:00:10,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,757 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 18:00:10,757 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 18:00:10,757 INFO L273 TraceCheckUtils]: 40: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,757 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 18:00:10,758 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 18:00:10,758 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 18:00:10,773 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 18:00:10,788 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 18:00:10,798 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 18:00:10,814 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 18:00:10,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 18:00:10,815 INFO L273 TraceCheckUtils]: 30: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 18:00:10,815 INFO L273 TraceCheckUtils]: 29: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,815 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 18:00:10,816 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 18:00:10,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,816 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 18:00:10,816 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 18:00:10,817 INFO L273 TraceCheckUtils]: 23: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,817 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 18:00:10,817 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 18:00:10,820 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 18:00:10,822 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 18:00:10,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,822 INFO L273 TraceCheckUtils]: 17: Hoare triple {1034#true} #res := ~ret~0[32:0]; {1034#true} is VALID [2018-11-14 18:00:10,822 INFO L273 TraceCheckUtils]: 16: Hoare triple {1034#true} assume !~bvslt32(~i~0, ~N~0); {1034#true} is VALID [2018-11-14 18:00:10,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,823 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 18:00:10,823 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 18:00:10,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,823 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 18:00:10,824 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 18:00:10,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,824 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 18:00:10,825 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 18:00:10,828 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 18:00:10,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {1034#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1034#true} is VALID [2018-11-14 18:00:10,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {1034#true} call #t~ret11 := main(); {1034#true} is VALID [2018-11-14 18:00:10,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1034#true} {1034#true} #62#return; {1034#true} is VALID [2018-11-14 18:00:10,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {1034#true} assume true; {1034#true} is VALID [2018-11-14 18:00:10,830 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 18:00:10,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {1034#true} call ULTIMATE.init(); {1034#true} is VALID [2018-11-14 18:00:10,833 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 18:00:10,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:00:10,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-14 18:00:10,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 18:00:10,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:00:10,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:00:10,944 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 18:00:10,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:00:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:00:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:00:10,945 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 10 states. [2018-11-14 18:00:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:12,191 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2018-11-14 18:00:12,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:00:12,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2018-11-14 18:00:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:00:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:00:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 18:00:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:00:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 96 transitions. [2018-11-14 18:00:12,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 96 transitions. [2018-11-14 18:00:12,382 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 18:00:12,385 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:00:12,385 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 18:00:12,386 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 18:00:12,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 18:00:12,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-11-14 18:00:12,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:00:12,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 59 states. [2018-11-14 18:00:12,442 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 59 states. [2018-11-14 18:00:12,442 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 59 states. [2018-11-14 18:00:12,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:12,448 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 18:00:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 18:00:12,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:12,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:12,450 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 65 states. [2018-11-14 18:00:12,450 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 65 states. [2018-11-14 18:00:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:00:12,454 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2018-11-14 18:00:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2018-11-14 18:00:12,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:00:12,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:00:12,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:00:12,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:00:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-14 18:00:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-11-14 18:00:12,461 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 54 [2018-11-14 18:00:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:00:12,461 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-11-14 18:00:12,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:00:12,462 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-11-14 18:00:12,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 18:00:12,464 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:00:12,464 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 18:00:12,464 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:00:12,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:00:12,465 INFO L82 PathProgramCache]: Analyzing trace with hash 434139659, now seen corresponding path program 1 times [2018-11-14 18:00:12,465 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:00:12,465 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 18:00:12,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:00:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:00:14,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:00:15,335 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 18:00:15,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:00:15,479 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 18:00:15,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:00:15,586 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 18:00:15,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 18:00:15,612 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 18:00:15,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:15,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:15,645 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:61, output treesize:35 [2018-11-14 18:00:17,140 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 18:00:17,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:00:17,161 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 18:00:17,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:00:17,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:17,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:17,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:83, output treesize:64 [2018-11-14 18:00:17,312 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:00:17,721 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 18:00:17,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:00:17,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:00:17,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:17,750 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 18:00:17,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:00:17,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:17,869 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 18:00:17,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:80, output treesize:65 [2018-11-14 18:00:17,908 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:00:18,685 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 18:00:18,706 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:18,715 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 18:00:18,719 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 18:00:18,744 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 18:00:18,774 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 18:00:18,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:43 [2018-11-14 18:00:18,817 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:00:19,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {1703#true} call ULTIMATE.init(); {1703#true} is VALID [2018-11-14 18:00:19,294 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 18:00:19,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1703#true} assume true; {1703#true} is VALID [2018-11-14 18:00:19,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1703#true} {1703#true} #62#return; {1703#true} is VALID [2018-11-14 18:00:19,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {1703#true} call #t~ret11 := main(); {1703#true} is VALID [2018-11-14 18:00:19,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {1703#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {1703#true} is VALID [2018-11-14 18:00:19,296 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 18:00:19,296 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 18:00:19,297 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 18:00:19,298 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 18:00:19,299 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 18:00:19,301 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 18:00:19,302 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 18:00:19,554 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 18:00:19,555 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 18:00:19,556 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 18:00:19,557 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 18:00:19,609 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 18:00:19,610 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 18:00:19,611 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 18:00:19,695 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 18:00:19,696 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 18:00:19,697 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 18:00:19,697 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 18:00:19,699 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 18:00:19,701 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 18:00:19,702 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 18:00:19,951 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 18:00:19,952 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 18:00:19,952 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 18:00:19,953 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 18:00:20,001 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 18:00:20,002 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 18:00:20,077 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 18:00:20,140 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 18:00:20,247 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 18:00:20,513 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 18:00:20,515 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 18:00:20,518 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 18:00:20,522 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 18:00:20,565 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 18:00:20,566 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 18:00:20,566 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 18:00:20,567 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 18:00:20,569 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 18:00:20,570 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 18:00:20,571 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 18:00:20,844 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 18:00:20,845 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 18:00:20,845 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 18:00:20,846 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 18:00:21,262 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 18:00:21,264 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 18:00:21,468 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 18:00:22,384 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 18:00:23,022 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 18:00:23,022 INFO L273 TraceCheckUtils]: 56: Hoare triple {1704#false} assume !false; {1704#false} is VALID [2018-11-14 18:00:23,049 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 18:00:23,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:00:39,206 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-14 18:00:41,937 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-14 18:00:42,749 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-14 18:00:43,889 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-14 18:00:45,052 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 18:00:46,390 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 18:00:49,392 WARN L179 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-14 18:00:49,532 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-14 18:00:49,747 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 18:00:49,853 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 18:00:51,059 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 18:00:51,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:53,082 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (select v_arrayElimCell_10 (bvadd |main_~#x~0.offset| (_ bv4 32))) (select v_arrayElimCell_10 |main_~#x~0.offset|)) [2018-11-14 18:00:53,136 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:53,137 INFO L303 Elim1Store]: Index analysis took 2075 ms [2018-11-14 18:00:53,138 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 18:00:53,799 WARN L179 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34 [2018-11-14 18:00:53,859 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:53,876 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:53,878 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 18:00:53,966 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 18:00:54,696 WARN L179 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2018-11-14 18:00:54,702 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:00:54,704 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 18:00:54,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:00:54,721 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 18:00:54,734 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 18:00:54,746 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 18:00:54,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:00:54,777 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 18:00:54,777 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:225, output treesize:14 [2018-11-14 18:00:54,792 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:00:57,708 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-14 18:00:58,810 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-14 18:01:00,040 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-14 18:01:01,199 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2018-11-14 18:01:02,518 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-14 18:01:03,943 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-14 18:01:04,132 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 18:01:04,158 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:04,179 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 18:01:04,185 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 18:01:04,372 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:04,433 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:04,480 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-11-14 18:01:05,023 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 18:01:09,576 WARN L179 SmtUtils]: Spent 4.35 s on a formula simplification. DAG size of input: 230 DAG size of output: 209 [2018-11-14 18:01:09,642 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:01:09,642 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:09,645 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 18:01:09,744 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 18:01:14,028 WARN L179 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2018-11-14 18:01:14,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:01:14,147 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 18:01:14,152 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 18:01:14,178 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 18:01:14,223 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 18:01:18,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:18,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:18,089 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:18,457 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 3 case distinctions, treesize of input 116 treesize of output 166 [2018-11-14 18:01:18,593 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:18,594 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:18,619 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:19,553 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 1 case distinctions, treesize of input 143 treesize of output 137 [2018-11-14 18:01:21,805 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-11-14 18:01:21,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:21,909 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:21,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,003 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-11-14 18:01:22,089 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 97 [2018-11-14 18:01:22,134 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 18:01:22,221 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,222 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,228 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,271 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 98 [2018-11-14 18:01:22,286 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-14 18:01:22,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,404 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,431 INFO L303 Elim1Store]: Index analysis took 106 ms [2018-11-14 18:01:22,457 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 116 [2018-11-14 18:01:22,477 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 18:01:22,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,522 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,577 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 91 [2018-11-14 18:01:22,590 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 18:01:22,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,652 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,744 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 91 [2018-11-14 18:01:22,753 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 18:01:22,827 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,828 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,851 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:22,923 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 116 [2018-11-14 18:01:22,964 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 18:01:23,026 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:23,028 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:23,054 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:23,113 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 109 [2018-11-14 18:01:23,129 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 18:01:26,105 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 14 xjuncts. [2018-11-14 18:01:30,083 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:30,085 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:30,087 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:30,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 117 [2018-11-14 18:01:32,584 WARN L179 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2018-11-14 18:01:32,614 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 95 [2018-11-14 18:01:32,643 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,664 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 83 [2018-11-14 18:01:32,696 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,712 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 84 [2018-11-14 18:01:32,731 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,749 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2018-11-14 18:01:32,776 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,789 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,791 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,792 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 77 [2018-11-14 18:01:32,807 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,879 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,908 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 102 [2018-11-14 18:01:32,951 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:32,964 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,966 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,967 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:32,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2018-11-14 18:01:32,984 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:35,134 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 14 dim-0 vars, and 7 xjuncts. [2018-11-14 18:01:43,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:43,494 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:43,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:43,495 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:43,548 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 116 treesize of output 136 [2018-11-14 18:01:44,661 WARN L179 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2018-11-14 18:01:44,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,729 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,730 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,766 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 111 [2018-11-14 18:01:44,771 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 18:01:44,820 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,821 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,821 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,822 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,850 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 86 [2018-11-14 18:01:44,853 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:44,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,981 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:44,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,012 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 92 [2018-11-14 18:01:45,016 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:45,073 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,074 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,075 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,076 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,111 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 93 [2018-11-14 18:01:45,114 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,218 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 86 [2018-11-14 18:01:45,222 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:45,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,326 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 104 [2018-11-14 18:01:45,330 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:45,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:01:45,430 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 111 [2018-11-14 18:01:45,435 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 18:01:47,073 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 7 xjuncts.