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/reducercommutativity/rangesum05_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:51:07,750 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:51:07,752 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:51:07,764 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:51:07,765 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:51:07,766 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:51:07,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:51:07,769 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:51:07,771 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:51:07,771 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:51:07,772 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:51:07,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:51:07,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:51:07,777 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:51:07,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:51:07,786 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:51:07,787 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:51:07,789 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:51:07,790 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:51:07,792 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:51:07,793 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:51:07,794 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:51:07,796 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:51:07,796 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:51:07,796 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:51:07,797 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:51:07,798 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:51:07,799 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:51:07,800 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:51:07,801 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:51:07,801 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:51:07,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:51:07,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:51:07,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:51:07,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:51:07,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:51:07,806 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 17:51:07,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:51:07,833 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:51:07,834 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:51:07,834 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:51:07,835 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:51:07,835 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:51:07,836 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:51:07,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:51:07,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:51:07,837 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:51:07,837 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:51:07,838 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:51:07,838 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:51:07,838 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:51:07,838 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:51:07,838 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:51:07,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:51:07,839 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:51:07,839 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:51:07,839 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:51:07,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:51:07,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:51:07,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:51:07,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:51:07,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:51:07,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:51:07,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:51:07,842 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:51:07,842 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:51:07,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:51:07,843 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:51:07,843 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:51:07,843 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:51:07,921 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:51:07,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:51:07,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:51:07,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:51:07,941 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:51:07,942 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-14 17:51:08,006 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c630d4b3/3d92bb58f91240f380fb6bd2bc5ac8dc/FLAGa60b2c1d4 [2018-11-14 17:51:08,520 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:51:08,521 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum05_false-unreach-call_true-termination.i [2018-11-14 17:51:08,528 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c630d4b3/3d92bb58f91240f380fb6bd2bc5ac8dc/FLAGa60b2c1d4 [2018-11-14 17:51:08,546 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c630d4b3/3d92bb58f91240f380fb6bd2bc5ac8dc [2018-11-14 17:51:08,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:51:08,560 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:51:08,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:51:08,561 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:51:08,565 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:51:08,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628dd538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08, skipping insertion in model container [2018-11-14 17:51:08,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:51:08,607 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:51:08,845 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:51:08,859 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:51:08,907 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:51:08,935 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:51:08,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08 WrapperNode [2018-11-14 17:51:08,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:51:08,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:51:08,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:51:08,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:51:08,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (1/1) ... [2018-11-14 17:51:08,992 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:51:08,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:51:08,993 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:51:08,993 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:51:08,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (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 17:51:09,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:51:09,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:51:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2018-11-14 17:51:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2018-11-14 17:51:09,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:51:09,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:51:09,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:51:09,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:51:09,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:51:09,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:51:09,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:51:09,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:51:10,373 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:51:10,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:10 BoogieIcfgContainer [2018-11-14 17:51:10,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:51:10,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:51:10,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:51:10,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:51:10,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:51:08" (1/3) ... [2018-11-14 17:51:10,386 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afc1b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:10, skipping insertion in model container [2018-11-14 17:51:10,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:51:08" (2/3) ... [2018-11-14 17:51:10,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afc1b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:51:10, skipping insertion in model container [2018-11-14 17:51:10,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:51:10" (3/3) ... [2018-11-14 17:51:10,390 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum05_false-unreach-call_true-termination.i [2018-11-14 17:51:10,401 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:51:10,410 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:51:10,431 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:51:10,476 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:51:10,477 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:51:10,477 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:51:10,477 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:51:10,478 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:51:10,478 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:51:10,478 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:51:10,478 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:51:10,479 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:51:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-11-14 17:51:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:51:10,511 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:10,512 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:10,514 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:10,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:10,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1049289672, now seen corresponding path program 1 times [2018-11-14 17:51:10,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:10,525 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 17:51:10,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:10,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:10,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {43#true} is VALID [2018-11-14 17:51:10,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {43#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {43#true} is VALID [2018-11-14 17:51:10,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2018-11-14 17:51:10,814 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #81#return; {43#true} is VALID [2018-11-14 17:51:10,814 INFO L256 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret12 := main(); {43#true} is VALID [2018-11-14 17:51:10,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {43#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {43#true} is VALID [2018-11-14 17:51:10,815 INFO L256 TraceCheckUtils]: 6: Hoare triple {43#true} call init_nondet(~#x~0.base, ~#x~0.offset); {43#true} is VALID [2018-11-14 17:51:10,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {43#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {43#true} is VALID [2018-11-14 17:51:10,816 INFO L273 TraceCheckUtils]: 8: Hoare triple {43#true} assume !true; {44#false} is VALID [2018-11-14 17:51:10,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-14 17:51:10,817 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #85#return; {44#false} is VALID [2018-11-14 17:51:10,817 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {44#false} is VALID [2018-11-14 17:51:10,817 INFO L256 TraceCheckUtils]: 12: Hoare triple {44#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {44#false} is VALID [2018-11-14 17:51:10,818 INFO L273 TraceCheckUtils]: 13: Hoare triple {44#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {44#false} is VALID [2018-11-14 17:51:10,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 17:51:10,818 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {44#false} is VALID [2018-11-14 17:51:10,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-14 17:51:10,819 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {44#false} {44#false} #87#return; {44#false} is VALID [2018-11-14 17:51:10,819 INFO L273 TraceCheckUtils]: 18: Hoare triple {44#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {44#false} is VALID [2018-11-14 17:51:10,819 INFO L256 TraceCheckUtils]: 19: Hoare triple {44#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {44#false} is VALID [2018-11-14 17:51:10,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {44#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {44#false} is VALID [2018-11-14 17:51:10,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 17:51:10,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {44#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {44#false} is VALID [2018-11-14 17:51:10,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-14 17:51:10,821 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {44#false} {44#false} #89#return; {44#false} is VALID [2018-11-14 17:51:10,821 INFO L273 TraceCheckUtils]: 25: Hoare triple {44#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {44#false} is VALID [2018-11-14 17:51:10,822 INFO L273 TraceCheckUtils]: 26: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 17:51:10,822 INFO L273 TraceCheckUtils]: 27: Hoare triple {44#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {44#false} is VALID [2018-11-14 17:51:10,823 INFO L256 TraceCheckUtils]: 28: Hoare triple {44#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {44#false} is VALID [2018-11-14 17:51:10,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {44#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {44#false} is VALID [2018-11-14 17:51:10,823 INFO L273 TraceCheckUtils]: 30: Hoare triple {44#false} assume !true; {44#false} is VALID [2018-11-14 17:51:10,823 INFO L273 TraceCheckUtils]: 31: Hoare triple {44#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {44#false} is VALID [2018-11-14 17:51:10,824 INFO L273 TraceCheckUtils]: 32: Hoare triple {44#false} assume true; {44#false} is VALID [2018-11-14 17:51:10,824 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {44#false} {44#false} #91#return; {44#false} is VALID [2018-11-14 17:51:10,824 INFO L273 TraceCheckUtils]: 34: Hoare triple {44#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {44#false} is VALID [2018-11-14 17:51:10,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {44#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {44#false} is VALID [2018-11-14 17:51:10,825 INFO L273 TraceCheckUtils]: 36: Hoare triple {44#false} assume !false; {44#false} is VALID [2018-11-14 17:51:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-14 17:51:10,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:10,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:51:10,848 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 17:51:10,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:10,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:51:11,030 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 17:51:11,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:51:11,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:51:11,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:51:11,042 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-11-14 17:51:11,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:11,393 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2018-11-14 17:51:11,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:51:11,394 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2018-11-14 17:51:11,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:51:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2018-11-14 17:51:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:51:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 90 transitions. [2018-11-14 17:51:11,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 90 transitions. [2018-11-14 17:51:12,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:12,208 INFO L225 Difference]: With dead ends: 69 [2018-11-14 17:51:12,208 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:51:12,212 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 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 17:51:12,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:51:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-14 17:51:12,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:12,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-14 17:51:12,275 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:51:12,275 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:51:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:12,282 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 17:51:12,282 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 17:51:12,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:12,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:12,284 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-14 17:51:12,284 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-14 17:51:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:12,290 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-14 17:51:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 17:51:12,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:12,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:12,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:12,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:51:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 17:51:12,299 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 37 [2018-11-14 17:51:12,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:12,299 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 17:51:12,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:51:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 17:51:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:51:12,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:12,302 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, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:12,302 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:12,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1338067039, now seen corresponding path program 1 times [2018-11-14 17:51:12,304 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:12,304 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 17:51:12,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:12,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:12,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2018-11-14 17:51:12,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {361#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {361#true} is VALID [2018-11-14 17:51:12,500 INFO L273 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:51:12,501 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #81#return; {361#true} is VALID [2018-11-14 17:51:12,501 INFO L256 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret12 := main(); {361#true} is VALID [2018-11-14 17:51:12,501 INFO L273 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {361#true} is VALID [2018-11-14 17:51:12,501 INFO L256 TraceCheckUtils]: 6: Hoare triple {361#true} call init_nondet(~#x~0.base, ~#x~0.offset); {361#true} is VALID [2018-11-14 17:51:12,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {361#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {361#true} is VALID [2018-11-14 17:51:12,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:51:12,502 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#true} assume !~bvslt32(~i~0, 5bv32); {361#true} is VALID [2018-11-14 17:51:12,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {361#true} assume true; {361#true} is VALID [2018-11-14 17:51:12,503 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {361#true} {361#true} #85#return; {361#true} is VALID [2018-11-14 17:51:12,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {361#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {361#true} is VALID [2018-11-14 17:51:12,504 INFO L256 TraceCheckUtils]: 13: Hoare triple {361#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {361#true} is VALID [2018-11-14 17:51:12,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {361#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {408#(= (_ bv0 32) rangesum_~cnt~0)} is VALID [2018-11-14 17:51:12,510 INFO L273 TraceCheckUtils]: 15: Hoare triple {408#(= (_ bv0 32) rangesum_~cnt~0)} assume true; {408#(= (_ bv0 32) rangesum_~cnt~0)} is VALID [2018-11-14 17:51:12,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {408#(= (_ bv0 32) rangesum_~cnt~0)} assume !~bvslt32(~i~1, 5bv32); {408#(= (_ bv0 32) rangesum_~cnt~0)} is VALID [2018-11-14 17:51:12,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {408#(= (_ bv0 32) rangesum_~cnt~0)} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {362#false} is VALID [2018-11-14 17:51:12,530 INFO L273 TraceCheckUtils]: 18: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,530 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {362#false} {361#true} #87#return; {362#false} is VALID [2018-11-14 17:51:12,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {362#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {362#false} is VALID [2018-11-14 17:51:12,531 INFO L256 TraceCheckUtils]: 21: Hoare triple {362#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {362#false} is VALID [2018-11-14 17:51:12,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {362#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {362#false} is VALID [2018-11-14 17:51:12,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {362#false} assume !~bvslt32(~i~1, 5bv32); {362#false} is VALID [2018-11-14 17:51:12,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {362#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {362#false} is VALID [2018-11-14 17:51:12,532 INFO L273 TraceCheckUtils]: 26: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,533 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {362#false} {362#false} #89#return; {362#false} is VALID [2018-11-14 17:51:12,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {362#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {362#false} is VALID [2018-11-14 17:51:12,533 INFO L273 TraceCheckUtils]: 29: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {362#false} assume !~bvslt32(~i~2, 4bv32); {362#false} is VALID [2018-11-14 17:51:12,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {362#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {362#false} is VALID [2018-11-14 17:51:12,537 INFO L256 TraceCheckUtils]: 32: Hoare triple {362#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {362#false} is VALID [2018-11-14 17:51:12,537 INFO L273 TraceCheckUtils]: 33: Hoare triple {362#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {362#false} is VALID [2018-11-14 17:51:12,537 INFO L273 TraceCheckUtils]: 34: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,538 INFO L273 TraceCheckUtils]: 35: Hoare triple {362#false} assume !~bvslt32(~i~1, 5bv32); {362#false} is VALID [2018-11-14 17:51:12,538 INFO L273 TraceCheckUtils]: 36: Hoare triple {362#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {362#false} is VALID [2018-11-14 17:51:12,538 INFO L273 TraceCheckUtils]: 37: Hoare triple {362#false} assume true; {362#false} is VALID [2018-11-14 17:51:12,539 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {362#false} {362#false} #91#return; {362#false} is VALID [2018-11-14 17:51:12,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {362#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {362#false} is VALID [2018-11-14 17:51:12,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {362#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {362#false} is VALID [2018-11-14 17:51:12,540 INFO L273 TraceCheckUtils]: 41: Hoare triple {362#false} assume !false; {362#false} is VALID [2018-11-14 17:51:12,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:51:12,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:12,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:51:12,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:12,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:12,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:12,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:12,915 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-11-14 17:51:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:13,530 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2018-11-14 17:51:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:13,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:51:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-14 17:51:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2018-11-14 17:51:13,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2018-11-14 17:51:14,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:14,071 INFO L225 Difference]: With dead ends: 62 [2018-11-14 17:51:14,071 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:51:14,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:51:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-14 17:51:14,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:14,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 40 states. [2018-11-14 17:51:14,091 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 40 states. [2018-11-14 17:51:14,091 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 40 states. [2018-11-14 17:51:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:14,096 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 17:51:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 17:51:14,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:14,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:14,098 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states. [2018-11-14 17:51:14,098 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states. [2018-11-14 17:51:14,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:14,103 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 17:51:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 17:51:14,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:14,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:14,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:14,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:51:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-14 17:51:14,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 42 [2018-11-14 17:51:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:14,110 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-14 17:51:14,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:51:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:51:14,112 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:14,112 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, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:14,113 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:14,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:14,113 INFO L82 PathProgramCache]: Analyzing trace with hash 642796544, now seen corresponding path program 1 times [2018-11-14 17:51:14,114 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:14,114 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 17:51:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:14,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:14,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2018-11-14 17:51:14,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {708#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {708#true} is VALID [2018-11-14 17:51:14,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {708#true} assume true; {708#true} is VALID [2018-11-14 17:51:14,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {708#true} {708#true} #81#return; {708#true} is VALID [2018-11-14 17:51:14,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {708#true} call #t~ret12 := main(); {708#true} is VALID [2018-11-14 17:51:14,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {708#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {708#true} is VALID [2018-11-14 17:51:14,342 INFO L256 TraceCheckUtils]: 6: Hoare triple {708#true} call init_nondet(~#x~0.base, ~#x~0.offset); {708#true} is VALID [2018-11-14 17:51:14,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {708#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {734#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:14,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {734#(= init_nondet_~i~0 (_ bv0 32))} assume true; {734#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:14,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {734#(= init_nondet_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {709#false} is VALID [2018-11-14 17:51:14,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,345 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {709#false} {708#true} #85#return; {709#false} is VALID [2018-11-14 17:51:14,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {709#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {709#false} is VALID [2018-11-14 17:51:14,346 INFO L256 TraceCheckUtils]: 13: Hoare triple {709#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {709#false} is VALID [2018-11-14 17:51:14,346 INFO L273 TraceCheckUtils]: 14: Hoare triple {709#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,346 INFO L273 TraceCheckUtils]: 15: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {709#false} assume !~bvslt32(~i~1, 5bv32); {709#false} is VALID [2018-11-14 17:51:14,347 INFO L273 TraceCheckUtils]: 17: Hoare triple {709#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,347 INFO L273 TraceCheckUtils]: 18: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,348 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {709#false} {709#false} #87#return; {709#false} is VALID [2018-11-14 17:51:14,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {709#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {709#false} is VALID [2018-11-14 17:51:14,348 INFO L256 TraceCheckUtils]: 21: Hoare triple {709#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {709#false} is VALID [2018-11-14 17:51:14,349 INFO L273 TraceCheckUtils]: 22: Hoare triple {709#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,349 INFO L273 TraceCheckUtils]: 23: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,349 INFO L273 TraceCheckUtils]: 24: Hoare triple {709#false} assume !~bvslt32(~i~1, 5bv32); {709#false} is VALID [2018-11-14 17:51:14,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {709#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,350 INFO L273 TraceCheckUtils]: 26: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,350 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {709#false} {709#false} #89#return; {709#false} is VALID [2018-11-14 17:51:14,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {709#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,351 INFO L273 TraceCheckUtils]: 29: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,351 INFO L273 TraceCheckUtils]: 30: Hoare triple {709#false} assume !~bvslt32(~i~2, 4bv32); {709#false} is VALID [2018-11-14 17:51:14,351 INFO L273 TraceCheckUtils]: 31: Hoare triple {709#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {709#false} is VALID [2018-11-14 17:51:14,352 INFO L256 TraceCheckUtils]: 32: Hoare triple {709#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {709#false} is VALID [2018-11-14 17:51:14,352 INFO L273 TraceCheckUtils]: 33: Hoare triple {709#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,352 INFO L273 TraceCheckUtils]: 34: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,353 INFO L273 TraceCheckUtils]: 35: Hoare triple {709#false} assume !~bvslt32(~i~1, 5bv32); {709#false} is VALID [2018-11-14 17:51:14,353 INFO L273 TraceCheckUtils]: 36: Hoare triple {709#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {709#false} is VALID [2018-11-14 17:51:14,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {709#false} assume true; {709#false} is VALID [2018-11-14 17:51:14,354 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {709#false} {709#false} #91#return; {709#false} is VALID [2018-11-14 17:51:14,354 INFO L273 TraceCheckUtils]: 39: Hoare triple {709#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {709#false} is VALID [2018-11-14 17:51:14,354 INFO L273 TraceCheckUtils]: 40: Hoare triple {709#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {709#false} is VALID [2018-11-14 17:51:14,355 INFO L273 TraceCheckUtils]: 41: Hoare triple {709#false} assume !false; {709#false} is VALID [2018-11-14 17:51:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:51:14,358 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:14,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:14,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:14,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:51:14,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:14,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:14,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:14,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:14,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:14,433 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-14 17:51:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:14,773 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2018-11-14 17:51:14,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:14,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:51:14,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:14,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:14,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:51:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:51:14,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-14 17:51:15,064 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:15,066 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:51:15,066 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:51:15,068 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:51:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-14 17:51:15,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:15,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-14 17:51:15,081 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-14 17:51:15,081 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-14 17:51:15,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:15,085 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 17:51:15,085 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 17:51:15,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:15,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:15,086 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-14 17:51:15,086 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-14 17:51:15,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:15,090 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 17:51:15,090 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 17:51:15,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:15,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:15,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:15,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:51:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-14 17:51:15,098 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 42 [2018-11-14 17:51:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:15,099 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-14 17:51:15,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 17:51:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:51:15,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:15,103 INFO L375 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1] [2018-11-14 17:51:15,103 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:15,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1732845926, now seen corresponding path program 1 times [2018-11-14 17:51:15,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:15,104 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 17:51:15,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:51:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:15,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:15,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2018-11-14 17:51:15,301 INFO L273 TraceCheckUtils]: 1: Hoare triple {1073#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1073#true} is VALID [2018-11-14 17:51:15,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,302 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #81#return; {1073#true} is VALID [2018-11-14 17:51:15,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret12 := main(); {1073#true} is VALID [2018-11-14 17:51:15,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {1073#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {1073#true} is VALID [2018-11-14 17:51:15,303 INFO L256 TraceCheckUtils]: 6: Hoare triple {1073#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1073#true} is VALID [2018-11-14 17:51:15,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {1099#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:15,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {1099#(= init_nondet_~i~0 (_ bv0 32))} assume true; {1099#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:15,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {1099#(= init_nondet_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1099#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:15,325 INFO L273 TraceCheckUtils]: 10: Hoare triple {1099#(= init_nondet_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1109#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:15,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {1109#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1109#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:15,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {1109#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {1074#false} is VALID [2018-11-14 17:51:15,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,329 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1074#false} {1073#true} #85#return; {1074#false} is VALID [2018-11-14 17:51:15,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {1074#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1074#false} is VALID [2018-11-14 17:51:15,329 INFO L256 TraceCheckUtils]: 16: Hoare triple {1074#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1074#false} is VALID [2018-11-14 17:51:15,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {1074#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {1074#false} assume !~bvslt32(~i~1, 5bv32); {1074#false} is VALID [2018-11-14 17:51:15,331 INFO L273 TraceCheckUtils]: 20: Hoare triple {1074#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,331 INFO L273 TraceCheckUtils]: 21: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,331 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1074#false} {1074#false} #87#return; {1074#false} is VALID [2018-11-14 17:51:15,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {1074#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,332 INFO L256 TraceCheckUtils]: 24: Hoare triple {1074#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1074#false} is VALID [2018-11-14 17:51:15,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {1074#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {1074#false} assume !~bvslt32(~i~1, 5bv32); {1074#false} is VALID [2018-11-14 17:51:15,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1074#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,333 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1074#false} {1074#false} #89#return; {1074#false} is VALID [2018-11-14 17:51:15,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {1074#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {1074#false} assume !~bvslt32(~i~2, 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {1074#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,335 INFO L256 TraceCheckUtils]: 35: Hoare triple {1074#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1074#false} is VALID [2018-11-14 17:51:15,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {1074#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {1074#false} assume !~bvslt32(~i~1, 5bv32); {1074#false} is VALID [2018-11-14 17:51:15,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {1074#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,336 INFO L273 TraceCheckUtils]: 40: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,337 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1074#false} {1074#false} #91#return; {1074#false} is VALID [2018-11-14 17:51:15,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {1074#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1074#false} is VALID [2018-11-14 17:51:15,337 INFO L273 TraceCheckUtils]: 43: Hoare triple {1074#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1074#false} is VALID [2018-11-14 17:51:15,337 INFO L273 TraceCheckUtils]: 44: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2018-11-14 17:51:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:51:15,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:15,511 INFO L273 TraceCheckUtils]: 44: Hoare triple {1074#false} assume !false; {1074#false} is VALID [2018-11-14 17:51:15,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {1074#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1074#false} is VALID [2018-11-14 17:51:15,512 INFO L273 TraceCheckUtils]: 42: Hoare triple {1074#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1074#false} is VALID [2018-11-14 17:51:15,512 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1073#true} {1074#false} #91#return; {1074#false} is VALID [2018-11-14 17:51:15,513 INFO L273 TraceCheckUtils]: 40: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,513 INFO L273 TraceCheckUtils]: 39: Hoare triple {1073#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,514 INFO L273 TraceCheckUtils]: 38: Hoare triple {1073#true} assume !~bvslt32(~i~1, 5bv32); {1073#true} is VALID [2018-11-14 17:51:15,514 INFO L273 TraceCheckUtils]: 37: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,514 INFO L273 TraceCheckUtils]: 36: Hoare triple {1073#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,514 INFO L256 TraceCheckUtils]: 35: Hoare triple {1074#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1073#true} is VALID [2018-11-14 17:51:15,515 INFO L273 TraceCheckUtils]: 34: Hoare triple {1074#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,515 INFO L273 TraceCheckUtils]: 33: Hoare triple {1074#false} assume !~bvslt32(~i~2, 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,515 INFO L273 TraceCheckUtils]: 32: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,515 INFO L273 TraceCheckUtils]: 31: Hoare triple {1074#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1074#false} is VALID [2018-11-14 17:51:15,516 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1073#true} {1074#false} #89#return; {1074#false} is VALID [2018-11-14 17:51:15,516 INFO L273 TraceCheckUtils]: 29: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,516 INFO L273 TraceCheckUtils]: 28: Hoare triple {1073#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {1073#true} assume !~bvslt32(~i~1, 5bv32); {1073#true} is VALID [2018-11-14 17:51:15,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {1073#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,517 INFO L256 TraceCheckUtils]: 24: Hoare triple {1074#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1073#true} is VALID [2018-11-14 17:51:15,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {1074#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1074#false} is VALID [2018-11-14 17:51:15,518 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1073#true} {1074#false} #87#return; {1074#false} is VALID [2018-11-14 17:51:15,518 INFO L273 TraceCheckUtils]: 21: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {1073#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1073#true} assume !~bvslt32(~i~1, 5bv32); {1073#true} is VALID [2018-11-14 17:51:15,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {1073#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1073#true} is VALID [2018-11-14 17:51:15,520 INFO L256 TraceCheckUtils]: 16: Hoare triple {1074#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1073#true} is VALID [2018-11-14 17:51:15,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {1074#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1074#false} is VALID [2018-11-14 17:51:15,520 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1074#false} {1073#true} #85#return; {1074#false} is VALID [2018-11-14 17:51:15,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {1074#false} assume true; {1074#false} is VALID [2018-11-14 17:51:15,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {1311#(bvslt init_nondet_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {1074#false} is VALID [2018-11-14 17:51:15,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {1311#(bvslt init_nondet_~i~0 (_ bv5 32))} assume true; {1311#(bvslt init_nondet_~i~0 (_ bv5 32))} is VALID [2018-11-14 17:51:15,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1311#(bvslt init_nondet_~i~0 (_ bv5 32))} is VALID [2018-11-14 17:51:15,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:15,531 INFO L273 TraceCheckUtils]: 8: Hoare triple {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} assume true; {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:15,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {1073#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {1318#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:15,536 INFO L256 TraceCheckUtils]: 6: Hoare triple {1073#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1073#true} is VALID [2018-11-14 17:51:15,537 INFO L273 TraceCheckUtils]: 5: Hoare triple {1073#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {1073#true} is VALID [2018-11-14 17:51:15,537 INFO L256 TraceCheckUtils]: 4: Hoare triple {1073#true} call #t~ret12 := main(); {1073#true} is VALID [2018-11-14 17:51:15,537 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1073#true} {1073#true} #81#return; {1073#true} is VALID [2018-11-14 17:51:15,537 INFO L273 TraceCheckUtils]: 2: Hoare triple {1073#true} assume true; {1073#true} is VALID [2018-11-14 17:51:15,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {1073#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1073#true} is VALID [2018-11-14 17:51:15,538 INFO L256 TraceCheckUtils]: 0: Hoare triple {1073#true} call ULTIMATE.init(); {1073#true} is VALID [2018-11-14 17:51:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:51:15,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:15,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:51:15,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-14 17:51:15,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:15,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:51:15,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:15,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:51:15,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:51:15,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:51:15,740 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 6 states. [2018-11-14 17:51:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:16,863 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2018-11-14 17:51:16,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:51:16,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-14 17:51:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-14 17:51:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2018-11-14 17:51:16,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 84 transitions. [2018-11-14 17:51:17,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:17,188 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:51:17,188 INFO L226 Difference]: Without dead ends: 51 [2018-11-14 17:51:17,189 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:51:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-14 17:51:17,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-14 17:51:17,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:17,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-14 17:51:17,225 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 17:51:17,225 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 17:51:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:17,228 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 17:51:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 17:51:17,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:17,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:17,229 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-14 17:51:17,229 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-14 17:51:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:17,233 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-14 17:51:17,233 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 17:51:17,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:17,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:17,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:17,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:17,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:51:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-14 17:51:17,237 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 45 [2018-11-14 17:51:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:17,238 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-14 17:51:17,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:51:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 17:51:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:51:17,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:17,240 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:17,240 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:17,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:17,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1421678720, now seen corresponding path program 2 times [2018-11-14 17:51:17,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:17,241 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 17:51:17,265 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:17,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:51:17,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:17,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:17,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {1626#true} call ULTIMATE.init(); {1626#true} is VALID [2018-11-14 17:51:17,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {1626#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1626#true} is VALID [2018-11-14 17:51:17,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,416 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1626#true} {1626#true} #81#return; {1626#true} is VALID [2018-11-14 17:51:17,416 INFO L256 TraceCheckUtils]: 4: Hoare triple {1626#true} call #t~ret12 := main(); {1626#true} is VALID [2018-11-14 17:51:17,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1626#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {1626#true} is VALID [2018-11-14 17:51:17,416 INFO L256 TraceCheckUtils]: 6: Hoare triple {1626#true} call init_nondet(~#x~0.base, ~#x~0.offset); {1626#true} is VALID [2018-11-14 17:51:17,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {1626#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,417 INFO L273 TraceCheckUtils]: 9: Hoare triple {1626#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1626#true} is VALID [2018-11-14 17:51:17,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {1626#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1626#true} is VALID [2018-11-14 17:51:17,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,418 INFO L273 TraceCheckUtils]: 12: Hoare triple {1626#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1626#true} is VALID [2018-11-14 17:51:17,418 INFO L273 TraceCheckUtils]: 13: Hoare triple {1626#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1626#true} is VALID [2018-11-14 17:51:17,419 INFO L273 TraceCheckUtils]: 14: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,419 INFO L273 TraceCheckUtils]: 15: Hoare triple {1626#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1626#true} is VALID [2018-11-14 17:51:17,419 INFO L273 TraceCheckUtils]: 16: Hoare triple {1626#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1626#true} is VALID [2018-11-14 17:51:17,419 INFO L273 TraceCheckUtils]: 17: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {1626#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1626#true} is VALID [2018-11-14 17:51:17,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {1626#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1626#true} is VALID [2018-11-14 17:51:17,420 INFO L273 TraceCheckUtils]: 20: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,420 INFO L273 TraceCheckUtils]: 21: Hoare triple {1626#true} assume !~bvslt32(~i~0, 5bv32); {1626#true} is VALID [2018-11-14 17:51:17,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,421 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1626#true} {1626#true} #85#return; {1626#true} is VALID [2018-11-14 17:51:17,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {1626#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {1626#true} is VALID [2018-11-14 17:51:17,422 INFO L256 TraceCheckUtils]: 25: Hoare triple {1626#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {1626#true} is VALID [2018-11-14 17:51:17,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {1626#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {1626#true} assume !~bvslt32(~i~1, 5bv32); {1626#true} is VALID [2018-11-14 17:51:17,423 INFO L273 TraceCheckUtils]: 29: Hoare triple {1626#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,423 INFO L273 TraceCheckUtils]: 30: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,423 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1626#true} {1626#true} #87#return; {1626#true} is VALID [2018-11-14 17:51:17,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {1626#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {1626#true} is VALID [2018-11-14 17:51:17,424 INFO L256 TraceCheckUtils]: 33: Hoare triple {1626#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {1626#true} is VALID [2018-11-14 17:51:17,424 INFO L273 TraceCheckUtils]: 34: Hoare triple {1626#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,424 INFO L273 TraceCheckUtils]: 35: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,424 INFO L273 TraceCheckUtils]: 36: Hoare triple {1626#true} assume !~bvslt32(~i~1, 5bv32); {1626#true} is VALID [2018-11-14 17:51:17,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {1626#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,425 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {1626#true} {1626#true} #89#return; {1626#true} is VALID [2018-11-14 17:51:17,425 INFO L273 TraceCheckUtils]: 40: Hoare triple {1626#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {1626#true} is VALID [2018-11-14 17:51:17,425 INFO L273 TraceCheckUtils]: 41: Hoare triple {1626#true} assume true; {1626#true} is VALID [2018-11-14 17:51:17,426 INFO L273 TraceCheckUtils]: 42: Hoare triple {1626#true} assume !~bvslt32(~i~2, 4bv32); {1626#true} is VALID [2018-11-14 17:51:17,426 INFO L273 TraceCheckUtils]: 43: Hoare triple {1626#true} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {1626#true} is VALID [2018-11-14 17:51:17,426 INFO L256 TraceCheckUtils]: 44: Hoare triple {1626#true} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {1626#true} is VALID [2018-11-14 17:51:17,431 INFO L273 TraceCheckUtils]: 45: Hoare triple {1626#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {1766#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:17,431 INFO L273 TraceCheckUtils]: 46: Hoare triple {1766#(= (_ bv0 32) rangesum_~i~1)} assume true; {1766#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:17,434 INFO L273 TraceCheckUtils]: 47: Hoare triple {1766#(= (_ bv0 32) rangesum_~i~1)} assume !~bvslt32(~i~1, 5bv32); {1627#false} is VALID [2018-11-14 17:51:17,434 INFO L273 TraceCheckUtils]: 48: Hoare triple {1627#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {1627#false} is VALID [2018-11-14 17:51:17,434 INFO L273 TraceCheckUtils]: 49: Hoare triple {1627#false} assume true; {1627#false} is VALID [2018-11-14 17:51:17,434 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {1627#false} {1626#true} #91#return; {1627#false} is VALID [2018-11-14 17:51:17,435 INFO L273 TraceCheckUtils]: 51: Hoare triple {1627#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {1627#false} is VALID [2018-11-14 17:51:17,435 INFO L273 TraceCheckUtils]: 52: Hoare triple {1627#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {1627#false} is VALID [2018-11-14 17:51:17,435 INFO L273 TraceCheckUtils]: 53: Hoare triple {1627#false} assume !false; {1627#false} is VALID [2018-11-14 17:51:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-14 17:51:17,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:17,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:17,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:17,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-14 17:51:17,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:17,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:17,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:17,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:17,528 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 3 states. [2018-11-14 17:51:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:17,889 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2018-11-14 17:51:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:17,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-11-14 17:51:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:51:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:51:17,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-14 17:51:18,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:18,149 INFO L225 Difference]: With dead ends: 80 [2018-11-14 17:51:18,149 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 17:51:18,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:18,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 17:51:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-14 17:51:18,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:18,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-14 17:51:18,233 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-14 17:51:18,233 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-14 17:51:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:18,236 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 17:51:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-14 17:51:18,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:18,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:18,237 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-14 17:51:18,237 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-14 17:51:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:18,240 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-14 17:51:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-14 17:51:18,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:18,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:18,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:18,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:51:18,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-14 17:51:18,244 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 54 [2018-11-14 17:51:18,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:18,245 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-14 17:51:18,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:51:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-14 17:51:18,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:18,246 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:18,247 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:18,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1055775225, now seen corresponding path program 1 times [2018-11-14 17:51:18,247 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:18,248 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:18,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:51:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:18,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:18,654 INFO L256 TraceCheckUtils]: 0: Hoare triple {2078#true} call ULTIMATE.init(); {2078#true} is VALID [2018-11-14 17:51:18,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {2078#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2078#true} is VALID [2018-11-14 17:51:18,655 INFO L273 TraceCheckUtils]: 2: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,655 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2078#true} {2078#true} #81#return; {2078#true} is VALID [2018-11-14 17:51:18,655 INFO L256 TraceCheckUtils]: 4: Hoare triple {2078#true} call #t~ret12 := main(); {2078#true} is VALID [2018-11-14 17:51:18,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {2078#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {2078#true} is VALID [2018-11-14 17:51:18,656 INFO L256 TraceCheckUtils]: 6: Hoare triple {2078#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2078#true} is VALID [2018-11-14 17:51:18,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {2078#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {2104#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:18,657 INFO L273 TraceCheckUtils]: 8: Hoare triple {2104#(= init_nondet_~i~0 (_ bv0 32))} assume true; {2104#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:18,657 INFO L273 TraceCheckUtils]: 9: Hoare triple {2104#(= init_nondet_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2104#(= init_nondet_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:51:18,658 INFO L273 TraceCheckUtils]: 10: Hoare triple {2104#(= init_nondet_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,659 INFO L273 TraceCheckUtils]: 12: Hoare triple {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,659 INFO L273 TraceCheckUtils]: 13: Hoare triple {2114#(= (bvadd init_nondet_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,660 INFO L273 TraceCheckUtils]: 14: Hoare triple {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,660 INFO L273 TraceCheckUtils]: 15: Hoare triple {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {2124#(= (bvadd init_nondet_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,661 INFO L273 TraceCheckUtils]: 17: Hoare triple {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,662 INFO L273 TraceCheckUtils]: 18: Hoare triple {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {2134#(= (bvadd init_nondet_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2144#(= (bvadd init_nondet_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,664 INFO L273 TraceCheckUtils]: 20: Hoare triple {2144#(= (bvadd init_nondet_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {2144#(= (bvadd init_nondet_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:51:18,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {2144#(= (bvadd init_nondet_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,665 INFO L273 TraceCheckUtils]: 22: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,665 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2079#false} {2078#true} #85#return; {2079#false} is VALID [2018-11-14 17:51:18,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {2079#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2079#false} is VALID [2018-11-14 17:51:18,666 INFO L256 TraceCheckUtils]: 25: Hoare triple {2079#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2079#false} is VALID [2018-11-14 17:51:18,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {2079#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {2079#false} assume !!~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {2079#false} assume !~bvsgt32(~i~1, 2bv32); {2079#false} is VALID [2018-11-14 17:51:18,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {2079#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {2079#false} assume !~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {2079#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L273 TraceCheckUtils]: 34: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2079#false} {2079#false} #87#return; {2079#false} is VALID [2018-11-14 17:51:18,668 INFO L273 TraceCheckUtils]: 36: Hoare triple {2079#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,669 INFO L256 TraceCheckUtils]: 37: Hoare triple {2079#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2079#false} is VALID [2018-11-14 17:51:18,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {2079#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {2079#false} assume !!~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,669 INFO L273 TraceCheckUtils]: 41: Hoare triple {2079#false} assume !~bvsgt32(~i~1, 2bv32); {2079#false} is VALID [2018-11-14 17:51:18,670 INFO L273 TraceCheckUtils]: 42: Hoare triple {2079#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2079#false} is VALID [2018-11-14 17:51:18,670 INFO L273 TraceCheckUtils]: 43: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,671 INFO L273 TraceCheckUtils]: 44: Hoare triple {2079#false} assume !~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {2079#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,671 INFO L273 TraceCheckUtils]: 46: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,671 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2079#false} {2079#false} #89#return; {2079#false} is VALID [2018-11-14 17:51:18,672 INFO L273 TraceCheckUtils]: 48: Hoare triple {2079#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,672 INFO L273 TraceCheckUtils]: 49: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,672 INFO L273 TraceCheckUtils]: 50: Hoare triple {2079#false} assume !~bvslt32(~i~2, 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,672 INFO L273 TraceCheckUtils]: 51: Hoare triple {2079#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,672 INFO L256 TraceCheckUtils]: 52: Hoare triple {2079#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2079#false} is VALID [2018-11-14 17:51:18,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {2079#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {2079#false} assume !!~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,674 INFO L273 TraceCheckUtils]: 56: Hoare triple {2079#false} assume !~bvsgt32(~i~1, 2bv32); {2079#false} is VALID [2018-11-14 17:51:18,674 INFO L273 TraceCheckUtils]: 57: Hoare triple {2079#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2079#false} is VALID [2018-11-14 17:51:18,674 INFO L273 TraceCheckUtils]: 58: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {2079#false} assume !~bvslt32(~i~1, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,675 INFO L273 TraceCheckUtils]: 60: Hoare triple {2079#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,675 INFO L273 TraceCheckUtils]: 61: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,675 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2079#false} {2079#false} #91#return; {2079#false} is VALID [2018-11-14 17:51:18,675 INFO L273 TraceCheckUtils]: 63: Hoare triple {2079#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2079#false} is VALID [2018-11-14 17:51:18,676 INFO L273 TraceCheckUtils]: 64: Hoare triple {2079#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2079#false} is VALID [2018-11-14 17:51:18,676 INFO L273 TraceCheckUtils]: 65: Hoare triple {2079#false} assume !false; {2079#false} is VALID [2018-11-14 17:51:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-14 17:51:18,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:18,928 INFO L273 TraceCheckUtils]: 65: Hoare triple {2079#false} assume !false; {2079#false} is VALID [2018-11-14 17:51:18,928 INFO L273 TraceCheckUtils]: 64: Hoare triple {2079#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2079#false} is VALID [2018-11-14 17:51:18,929 INFO L273 TraceCheckUtils]: 63: Hoare triple {2079#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2079#false} is VALID [2018-11-14 17:51:18,929 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {2078#true} {2079#false} #91#return; {2079#false} is VALID [2018-11-14 17:51:18,930 INFO L273 TraceCheckUtils]: 61: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,930 INFO L273 TraceCheckUtils]: 60: Hoare triple {2078#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,930 INFO L273 TraceCheckUtils]: 59: Hoare triple {2078#true} assume !~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,931 INFO L273 TraceCheckUtils]: 58: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,931 INFO L273 TraceCheckUtils]: 57: Hoare triple {2078#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2078#true} is VALID [2018-11-14 17:51:18,931 INFO L273 TraceCheckUtils]: 56: Hoare triple {2078#true} assume !~bvsgt32(~i~1, 2bv32); {2078#true} is VALID [2018-11-14 17:51:18,931 INFO L273 TraceCheckUtils]: 55: Hoare triple {2078#true} assume !!~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,931 INFO L273 TraceCheckUtils]: 54: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,932 INFO L273 TraceCheckUtils]: 53: Hoare triple {2078#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,932 INFO L256 TraceCheckUtils]: 52: Hoare triple {2079#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2078#true} is VALID [2018-11-14 17:51:18,932 INFO L273 TraceCheckUtils]: 51: Hoare triple {2079#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,932 INFO L273 TraceCheckUtils]: 50: Hoare triple {2079#false} assume !~bvslt32(~i~2, 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,932 INFO L273 TraceCheckUtils]: 49: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {2079#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2079#false} is VALID [2018-11-14 17:51:18,933 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {2078#true} {2079#false} #89#return; {2079#false} is VALID [2018-11-14 17:51:18,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,933 INFO L273 TraceCheckUtils]: 45: Hoare triple {2078#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,933 INFO L273 TraceCheckUtils]: 44: Hoare triple {2078#true} assume !~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,934 INFO L273 TraceCheckUtils]: 43: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,934 INFO L273 TraceCheckUtils]: 42: Hoare triple {2078#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2078#true} is VALID [2018-11-14 17:51:18,934 INFO L273 TraceCheckUtils]: 41: Hoare triple {2078#true} assume !~bvsgt32(~i~1, 2bv32); {2078#true} is VALID [2018-11-14 17:51:18,934 INFO L273 TraceCheckUtils]: 40: Hoare triple {2078#true} assume !!~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,935 INFO L273 TraceCheckUtils]: 39: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,935 INFO L273 TraceCheckUtils]: 38: Hoare triple {2078#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,935 INFO L256 TraceCheckUtils]: 37: Hoare triple {2079#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2078#true} is VALID [2018-11-14 17:51:18,936 INFO L273 TraceCheckUtils]: 36: Hoare triple {2079#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2079#false} is VALID [2018-11-14 17:51:18,936 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2078#true} {2079#false} #87#return; {2079#false} is VALID [2018-11-14 17:51:18,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {2078#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,937 INFO L273 TraceCheckUtils]: 32: Hoare triple {2078#true} assume !~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,937 INFO L273 TraceCheckUtils]: 31: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,937 INFO L273 TraceCheckUtils]: 30: Hoare triple {2078#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2078#true} is VALID [2018-11-14 17:51:18,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {2078#true} assume !~bvsgt32(~i~1, 2bv32); {2078#true} is VALID [2018-11-14 17:51:18,938 INFO L273 TraceCheckUtils]: 28: Hoare triple {2078#true} assume !!~bvslt32(~i~1, 5bv32); {2078#true} is VALID [2018-11-14 17:51:18,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {2078#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2078#true} is VALID [2018-11-14 17:51:18,938 INFO L256 TraceCheckUtils]: 25: Hoare triple {2079#false} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2078#true} is VALID [2018-11-14 17:51:18,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {2079#false} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2079#false} is VALID [2018-11-14 17:51:18,939 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2079#false} {2078#true} #85#return; {2079#false} is VALID [2018-11-14 17:51:18,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {2079#false} assume true; {2079#false} is VALID [2018-11-14 17:51:18,947 INFO L273 TraceCheckUtils]: 21: Hoare triple {2418#(bvslt init_nondet_~i~0 (_ bv5 32))} assume !~bvslt32(~i~0, 5bv32); {2079#false} is VALID [2018-11-14 17:51:18,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {2418#(bvslt init_nondet_~i~0 (_ bv5 32))} assume true; {2418#(bvslt init_nondet_~i~0 (_ bv5 32))} is VALID [2018-11-14 17:51:18,949 INFO L273 TraceCheckUtils]: 19: Hoare triple {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2418#(bvslt init_nondet_~i~0 (_ bv5 32))} is VALID [2018-11-14 17:51:18,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} assume true; {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,955 INFO L273 TraceCheckUtils]: 16: Hoare triple {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2425#(bvslt (bvadd init_nondet_~i~0 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,955 INFO L273 TraceCheckUtils]: 15: Hoare triple {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,958 INFO L273 TraceCheckUtils]: 14: Hoare triple {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} assume true; {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,964 INFO L273 TraceCheckUtils]: 13: Hoare triple {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2435#(bvslt (bvadd init_nondet_~i~0 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,973 INFO L273 TraceCheckUtils]: 12: Hoare triple {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} assume true; {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,978 INFO L273 TraceCheckUtils]: 10: Hoare triple {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2445#(bvslt (bvadd init_nondet_~i~0 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,978 INFO L273 TraceCheckUtils]: 9: Hoare triple {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} assume true; {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,979 INFO L273 TraceCheckUtils]: 7: Hoare triple {2078#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {2455#(bvslt (bvadd init_nondet_~i~0 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:18,979 INFO L256 TraceCheckUtils]: 6: Hoare triple {2078#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {2078#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L256 TraceCheckUtils]: 4: Hoare triple {2078#true} call #t~ret12 := main(); {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2078#true} {2078#true} #81#return; {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {2078#true} assume true; {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {2078#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2078#true} is VALID [2018-11-14 17:51:18,980 INFO L256 TraceCheckUtils]: 0: Hoare triple {2078#true} call ULTIMATE.init(); {2078#true} is VALID [2018-11-14 17:51:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-14 17:51:18,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:18,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:51:18,988 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-14 17:51:18,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:18,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:51:19,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:19,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:51:19,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:51:19,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:51:19,134 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 12 states. [2018-11-14 17:51:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:20,733 INFO L93 Difference]: Finished difference Result 90 states and 106 transitions. [2018-11-14 17:51:20,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 17:51:20,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2018-11-14 17:51:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:51:20,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2018-11-14 17:51:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:51:20,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2018-11-14 17:51:20,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 86 transitions. [2018-11-14 17:51:21,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:21,049 INFO L225 Difference]: With dead ends: 90 [2018-11-14 17:51:21,050 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 17:51:21,050 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:51:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 17:51:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-14 17:51:21,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:21,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-14 17:51:21,078 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-14 17:51:21,078 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-14 17:51:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:21,081 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 17:51:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 17:51:21,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:21,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:21,082 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-14 17:51:21,082 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-14 17:51:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:21,085 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-14 17:51:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-11-14 17:51:21,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:21,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:21,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:21,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 17:51:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-14 17:51:21,089 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 66 [2018-11-14 17:51:21,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:21,089 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-14 17:51:21,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:51:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-14 17:51:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 17:51:21,090 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:21,090 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:21,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:21,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:21,091 INFO L82 PathProgramCache]: Analyzing trace with hash -214540961, now seen corresponding path program 2 times [2018-11-14 17:51:21,091 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:21,091 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:21,111 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:21,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:51:21,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:21,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:21,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-14 17:51:21,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-14 17:51:21,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #81#return; {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret12 := main(); {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L256 TraceCheckUtils]: 6: Hoare triple {2796#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L273 TraceCheckUtils]: 9: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,479 INFO L273 TraceCheckUtils]: 10: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 11: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 12: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 13: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 15: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 16: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,480 INFO L273 TraceCheckUtils]: 17: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 18: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 19: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 20: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 21: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 22: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {2796#true} assume !~bvslt32(~i~0, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,482 INFO L273 TraceCheckUtils]: 25: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,482 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2796#true} {2796#true} #85#return; {2796#true} is VALID [2018-11-14 17:51:21,482 INFO L273 TraceCheckUtils]: 27: Hoare triple {2796#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2796#true} is VALID [2018-11-14 17:51:21,482 INFO L256 TraceCheckUtils]: 28: Hoare triple {2796#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2888#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {2888#(= (_ bv0 32) rangesum_~i~1)} assume true; {2888#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,484 INFO L273 TraceCheckUtils]: 31: Hoare triple {2888#(= (_ bv0 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {2888#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {2888#(= (_ bv0 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {2888#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,486 INFO L273 TraceCheckUtils]: 33: Hoare triple {2888#(= (_ bv0 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2901#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,486 INFO L273 TraceCheckUtils]: 34: Hoare triple {2901#(= (_ bv1 32) rangesum_~i~1)} assume true; {2901#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:21,488 INFO L273 TraceCheckUtils]: 35: Hoare triple {2901#(= (_ bv1 32) rangesum_~i~1)} assume !~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,488 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,488 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,488 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2797#false} {2796#true} #87#return; {2797#false} is VALID [2018-11-14 17:51:21,488 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,488 INFO L256 TraceCheckUtils]: 40: Hoare triple {2797#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 43: Hoare triple {2797#false} assume !!~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {2797#false} assume !~bvsgt32(~i~1, 2bv32); {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {2797#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-14 17:51:21,489 INFO L273 TraceCheckUtils]: 46: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,490 INFO L273 TraceCheckUtils]: 47: Hoare triple {2797#false} assume !~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,490 INFO L273 TraceCheckUtils]: 48: Hoare triple {2797#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,490 INFO L273 TraceCheckUtils]: 49: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,490 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2797#false} {2797#false} #89#return; {2797#false} is VALID [2018-11-14 17:51:21,490 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,491 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,491 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} assume !~bvslt32(~i~2, 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,491 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,491 INFO L256 TraceCheckUtils]: 55: Hoare triple {2797#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2797#false} is VALID [2018-11-14 17:51:21,491 INFO L273 TraceCheckUtils]: 56: Hoare triple {2797#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,492 INFO L273 TraceCheckUtils]: 57: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,492 INFO L273 TraceCheckUtils]: 58: Hoare triple {2797#false} assume !!~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,492 INFO L273 TraceCheckUtils]: 59: Hoare triple {2797#false} assume !~bvsgt32(~i~1, 2bv32); {2797#false} is VALID [2018-11-14 17:51:21,492 INFO L273 TraceCheckUtils]: 60: Hoare triple {2797#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2797#false} is VALID [2018-11-14 17:51:21,492 INFO L273 TraceCheckUtils]: 61: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {2797#false} assume !~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,493 INFO L273 TraceCheckUtils]: 63: Hoare triple {2797#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,493 INFO L273 TraceCheckUtils]: 64: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,493 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {2797#false} {2797#false} #91#return; {2797#false} is VALID [2018-11-14 17:51:21,493 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2797#false} is VALID [2018-11-14 17:51:21,494 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2797#false} is VALID [2018-11-14 17:51:21,494 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-14 17:51:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-14 17:51:21,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:21,677 INFO L273 TraceCheckUtils]: 68: Hoare triple {2797#false} assume !false; {2797#false} is VALID [2018-11-14 17:51:21,677 INFO L273 TraceCheckUtils]: 67: Hoare triple {2797#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {2797#false} is VALID [2018-11-14 17:51:21,677 INFO L273 TraceCheckUtils]: 66: Hoare triple {2797#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {2797#false} is VALID [2018-11-14 17:51:21,678 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {2796#true} {2797#false} #91#return; {2797#false} is VALID [2018-11-14 17:51:21,678 INFO L273 TraceCheckUtils]: 64: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,678 INFO L273 TraceCheckUtils]: 63: Hoare triple {2796#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,678 INFO L273 TraceCheckUtils]: 62: Hoare triple {2796#true} assume !~bvslt32(~i~1, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 60: Hoare triple {2796#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 59: Hoare triple {2796#true} assume !~bvsgt32(~i~1, 2bv32); {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 58: Hoare triple {2796#true} assume !!~bvslt32(~i~1, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 57: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 56: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L256 TraceCheckUtils]: 55: Hoare triple {2797#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,679 INFO L273 TraceCheckUtils]: 54: Hoare triple {2797#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 53: Hoare triple {2797#false} assume !~bvslt32(~i~2, 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 51: Hoare triple {2797#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,680 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {2796#true} {2797#false} #89#return; {2797#false} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 49: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 48: Hoare triple {2796#true} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,680 INFO L273 TraceCheckUtils]: 47: Hoare triple {2796#true} assume !~bvslt32(~i~1, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 46: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 45: Hoare triple {2796#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 44: Hoare triple {2796#true} assume !~bvsgt32(~i~1, 2bv32); {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {2796#true} assume !!~bvslt32(~i~1, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 42: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 41: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L256 TraceCheckUtils]: 40: Hoare triple {2797#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {2797#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {2797#false} is VALID [2018-11-14 17:51:21,682 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2797#false} {2796#true} #87#return; {2797#false} is VALID [2018-11-14 17:51:21,682 INFO L273 TraceCheckUtils]: 37: Hoare triple {2797#false} assume true; {2797#false} is VALID [2018-11-14 17:51:21,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {2797#false} assume !(~cnt~0 != 0bv32);#res := 0bv32; {2797#false} is VALID [2018-11-14 17:51:21,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {3109#(bvslt rangesum_~i~1 (_ bv5 32))} assume !~bvslt32(~i~1, 5bv32); {2797#false} is VALID [2018-11-14 17:51:21,683 INFO L273 TraceCheckUtils]: 34: Hoare triple {3109#(bvslt rangesum_~i~1 (_ bv5 32))} assume true; {3109#(bvslt rangesum_~i~1 (_ bv5 32))} is VALID [2018-11-14 17:51:21,686 INFO L273 TraceCheckUtils]: 33: Hoare triple {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3109#(bvslt rangesum_~i~1 (_ bv5 32))} is VALID [2018-11-14 17:51:21,686 INFO L273 TraceCheckUtils]: 32: Hoare triple {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume !~bvsgt32(~i~1, 2bv32); {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:21,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32); {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:21,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume true; {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:21,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3116#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:21,688 INFO L256 TraceCheckUtils]: 28: Hoare triple {2796#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,688 INFO L273 TraceCheckUtils]: 27: Hoare triple {2796#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {2796#true} is VALID [2018-11-14 17:51:21,688 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2796#true} {2796#true} #85#return; {2796#true} is VALID [2018-11-14 17:51:21,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {2796#true} assume !~bvslt32(~i~0, 5bv32); {2796#true} is VALID [2018-11-14 17:51:21,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,689 INFO L273 TraceCheckUtils]: 21: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,689 INFO L273 TraceCheckUtils]: 19: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,690 INFO L273 TraceCheckUtils]: 17: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,691 INFO L273 TraceCheckUtils]: 12: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,691 INFO L273 TraceCheckUtils]: 10: Hoare triple {2796#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2796#true} is VALID [2018-11-14 17:51:21,691 INFO L273 TraceCheckUtils]: 9: Hoare triple {2796#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2796#true} is VALID [2018-11-14 17:51:21,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,692 INFO L273 TraceCheckUtils]: 7: Hoare triple {2796#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {2796#true} is VALID [2018-11-14 17:51:21,692 INFO L256 TraceCheckUtils]: 6: Hoare triple {2796#true} call init_nondet(~#x~0.base, ~#x~0.offset); {2796#true} is VALID [2018-11-14 17:51:21,692 INFO L273 TraceCheckUtils]: 5: Hoare triple {2796#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {2796#true} is VALID [2018-11-14 17:51:21,692 INFO L256 TraceCheckUtils]: 4: Hoare triple {2796#true} call #t~ret12 := main(); {2796#true} is VALID [2018-11-14 17:51:21,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2796#true} {2796#true} #81#return; {2796#true} is VALID [2018-11-14 17:51:21,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {2796#true} assume true; {2796#true} is VALID [2018-11-14 17:51:21,693 INFO L273 TraceCheckUtils]: 1: Hoare triple {2796#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2796#true} is VALID [2018-11-14 17:51:21,693 INFO L256 TraceCheckUtils]: 0: Hoare triple {2796#true} call ULTIMATE.init(); {2796#true} is VALID [2018-11-14 17:51:21,695 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-14 17:51:21,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:21,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:51:21,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-14 17:51:21,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:21,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:51:21,773 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:21,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:51:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:51:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:51:21,774 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 6 states. [2018-11-14 17:51:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:22,711 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2018-11-14 17:51:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:51:22,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-14 17:51:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:22,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:22,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-14 17:51:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2018-11-14 17:51:22,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2018-11-14 17:51:23,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:23,005 INFO L225 Difference]: With dead ends: 95 [2018-11-14 17:51:23,005 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:51:23,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:51:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:51:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-14 17:51:23,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:23,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 63 states. [2018-11-14 17:51:23,196 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 63 states. [2018-11-14 17:51:23,197 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 63 states. [2018-11-14 17:51:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:23,200 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 17:51:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 17:51:23,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:23,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:23,201 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 67 states. [2018-11-14 17:51:23,201 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 67 states. [2018-11-14 17:51:23,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:23,204 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 17:51:23,204 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 17:51:23,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:23,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:23,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:23,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:23,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:51:23,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-14 17:51:23,207 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 69 [2018-11-14 17:51:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:23,208 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-14 17:51:23,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:51:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 17:51:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 17:51:23,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:23,209 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:23,210 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:23,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash 157313189, now seen corresponding path program 1 times [2018-11-14 17:51:23,210 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:23,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:51:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:24,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:24,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {3562#true} call ULTIMATE.init(); {3562#true} is VALID [2018-11-14 17:51:24,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {3562#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3562#true} is VALID [2018-11-14 17:51:24,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:24,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3562#true} {3562#true} #81#return; {3562#true} is VALID [2018-11-14 17:51:24,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {3562#true} call #t~ret12 := main(); {3562#true} is VALID [2018-11-14 17:51:24,997 INFO L273 TraceCheckUtils]: 5: Hoare triple {3562#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {3562#true} is VALID [2018-11-14 17:51:24,997 INFO L256 TraceCheckUtils]: 6: Hoare triple {3562#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:24,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {3562#true} is VALID [2018-11-14 17:51:24,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:24,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:24,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 15: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 16: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:24,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,000 INFO L273 TraceCheckUtils]: 18: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,000 INFO L273 TraceCheckUtils]: 19: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,000 INFO L273 TraceCheckUtils]: 20: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,000 INFO L273 TraceCheckUtils]: 21: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,000 INFO L273 TraceCheckUtils]: 22: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L273 TraceCheckUtils]: 23: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {3562#true} assume !~bvslt32(~i~0, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L273 TraceCheckUtils]: 25: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3562#true} {3562#true} #85#return; {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L273 TraceCheckUtils]: 27: Hoare triple {3562#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3562#true} is VALID [2018-11-14 17:51:25,001 INFO L256 TraceCheckUtils]: 28: Hoare triple {3562#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:25,010 INFO L273 TraceCheckUtils]: 29: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3654#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,011 INFO L273 TraceCheckUtils]: 30: Hoare triple {3654#(= (_ bv0 32) rangesum_~i~1)} assume true; {3654#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,011 INFO L273 TraceCheckUtils]: 31: Hoare triple {3654#(= (_ bv0 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {3654#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {3654#(= (_ bv0 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {3654#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,018 INFO L273 TraceCheckUtils]: 33: Hoare triple {3654#(= (_ bv0 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3667#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,019 INFO L273 TraceCheckUtils]: 34: Hoare triple {3667#(= (_ bv1 32) rangesum_~i~1)} assume true; {3667#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,019 INFO L273 TraceCheckUtils]: 35: Hoare triple {3667#(= (_ bv1 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {3667#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,019 INFO L273 TraceCheckUtils]: 36: Hoare triple {3667#(= (_ bv1 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {3667#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,020 INFO L273 TraceCheckUtils]: 37: Hoare triple {3667#(= (_ bv1 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3680#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,020 INFO L273 TraceCheckUtils]: 38: Hoare triple {3680#(= (_ bv2 32) rangesum_~i~1)} assume true; {3680#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,021 INFO L273 TraceCheckUtils]: 39: Hoare triple {3680#(= (_ bv2 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {3680#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:25,021 INFO L273 TraceCheckUtils]: 40: Hoare triple {3680#(= (_ bv2 32) rangesum_~i~1)} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,021 INFO L273 TraceCheckUtils]: 41: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,021 INFO L273 TraceCheckUtils]: 42: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,022 INFO L273 TraceCheckUtils]: 43: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,022 INFO L273 TraceCheckUtils]: 46: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,023 INFO L273 TraceCheckUtils]: 47: Hoare triple {3563#false} assume !~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,023 INFO L273 TraceCheckUtils]: 48: Hoare triple {3563#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3563#false} is VALID [2018-11-14 17:51:25,023 INFO L273 TraceCheckUtils]: 49: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,023 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3563#false} {3562#true} #87#return; {3563#false} is VALID [2018-11-14 17:51:25,023 INFO L273 TraceCheckUtils]: 51: Hoare triple {3563#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L256 TraceCheckUtils]: 52: Hoare triple {3563#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 53: Hoare triple {3563#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 54: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 55: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 56: Hoare triple {3563#false} assume !~bvsgt32(~i~1, 2bv32); {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 57: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,024 INFO L273 TraceCheckUtils]: 58: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 60: Hoare triple {3563#false} assume !~bvsgt32(~i~1, 2bv32); {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 61: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 62: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 63: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 64: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 65: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,025 INFO L273 TraceCheckUtils]: 66: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 67: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 68: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 69: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 70: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 71: Hoare triple {3563#false} assume !~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 72: Hoare triple {3563#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3563#false} is VALID [2018-11-14 17:51:25,026 INFO L273 TraceCheckUtils]: 73: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {3563#false} {3563#false} #89#return; {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 75: Hoare triple {3563#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 76: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 77: Hoare triple {3563#false} assume !~bvslt32(~i~2, 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 78: Hoare triple {3563#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L256 TraceCheckUtils]: 79: Hoare triple {3563#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 80: Hoare triple {3563#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3563#false} is VALID [2018-11-14 17:51:25,027 INFO L273 TraceCheckUtils]: 81: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 82: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 83: Hoare triple {3563#false} assume !~bvsgt32(~i~1, 2bv32); {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 84: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 85: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 86: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 87: Hoare triple {3563#false} assume !~bvsgt32(~i~1, 2bv32); {3563#false} is VALID [2018-11-14 17:51:25,028 INFO L273 TraceCheckUtils]: 88: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 89: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 90: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 91: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 92: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 93: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 94: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 95: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,029 INFO L273 TraceCheckUtils]: 96: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 97: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 98: Hoare triple {3563#false} assume !~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 99: Hoare triple {3563#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 100: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {3563#false} {3563#false} #91#return; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 102: Hoare triple {3563#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3563#false} is VALID [2018-11-14 17:51:25,030 INFO L273 TraceCheckUtils]: 103: Hoare triple {3563#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3563#false} is VALID [2018-11-14 17:51:25,031 INFO L273 TraceCheckUtils]: 104: Hoare triple {3563#false} assume !false; {3563#false} is VALID [2018-11-14 17:51:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 121 proven. 10 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2018-11-14 17:51:25,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:25,223 INFO L273 TraceCheckUtils]: 104: Hoare triple {3563#false} assume !false; {3563#false} is VALID [2018-11-14 17:51:25,224 INFO L273 TraceCheckUtils]: 103: Hoare triple {3563#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {3563#false} is VALID [2018-11-14 17:51:25,224 INFO L273 TraceCheckUtils]: 102: Hoare triple {3563#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {3563#false} is VALID [2018-11-14 17:51:25,224 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {3562#true} {3563#false} #91#return; {3563#false} is VALID [2018-11-14 17:51:25,224 INFO L273 TraceCheckUtils]: 100: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,224 INFO L273 TraceCheckUtils]: 99: Hoare triple {3562#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3562#true} is VALID [2018-11-14 17:51:25,224 INFO L273 TraceCheckUtils]: 98: Hoare triple {3562#true} assume !~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,225 INFO L273 TraceCheckUtils]: 97: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,225 INFO L273 TraceCheckUtils]: 96: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,225 INFO L273 TraceCheckUtils]: 95: Hoare triple {3562#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3562#true} is VALID [2018-11-14 17:51:25,225 INFO L273 TraceCheckUtils]: 94: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 93: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 92: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 91: Hoare triple {3562#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 90: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 89: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,226 INFO L273 TraceCheckUtils]: 88: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 87: Hoare triple {3562#true} assume !~bvsgt32(~i~1, 2bv32); {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 86: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 85: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 84: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 83: Hoare triple {3562#true} assume !~bvsgt32(~i~1, 2bv32); {3562#true} is VALID [2018-11-14 17:51:25,227 INFO L273 TraceCheckUtils]: 82: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,228 INFO L273 TraceCheckUtils]: 81: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,228 INFO L273 TraceCheckUtils]: 80: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3562#true} is VALID [2018-11-14 17:51:25,228 INFO L256 TraceCheckUtils]: 79: Hoare triple {3563#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:25,228 INFO L273 TraceCheckUtils]: 78: Hoare triple {3563#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,228 INFO L273 TraceCheckUtils]: 77: Hoare triple {3563#false} assume !~bvslt32(~i~2, 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,229 INFO L273 TraceCheckUtils]: 76: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,229 INFO L273 TraceCheckUtils]: 75: Hoare triple {3563#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {3563#false} is VALID [2018-11-14 17:51:25,229 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {3562#true} {3563#false} #89#return; {3563#false} is VALID [2018-11-14 17:51:25,229 INFO L273 TraceCheckUtils]: 73: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,229 INFO L273 TraceCheckUtils]: 72: Hoare triple {3562#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 71: Hoare triple {3562#true} assume !~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 70: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 69: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 68: Hoare triple {3562#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 67: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,230 INFO L273 TraceCheckUtils]: 66: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 65: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 64: Hoare triple {3562#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 63: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,231 INFO L273 TraceCheckUtils]: 60: Hoare triple {3562#true} assume !~bvsgt32(~i~1, 2bv32); {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 59: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 58: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 57: Hoare triple {3562#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 56: Hoare triple {3562#true} assume !~bvsgt32(~i~1, 2bv32); {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 55: Hoare triple {3562#true} assume !!~bvslt32(~i~1, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,232 INFO L273 TraceCheckUtils]: 54: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,233 INFO L273 TraceCheckUtils]: 53: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {3562#true} is VALID [2018-11-14 17:51:25,233 INFO L256 TraceCheckUtils]: 52: Hoare triple {3563#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:25,233 INFO L273 TraceCheckUtils]: 51: Hoare triple {3563#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {3563#false} is VALID [2018-11-14 17:51:25,233 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3563#false} {3562#true} #87#return; {3563#false} is VALID [2018-11-14 17:51:25,233 INFO L273 TraceCheckUtils]: 49: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,233 INFO L273 TraceCheckUtils]: 48: Hoare triple {3563#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 47: Hoare triple {3563#false} assume !~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 46: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 44: Hoare triple {3563#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {3563#false} assume !!~bvslt32(~i~1, 5bv32); {3563#false} is VALID [2018-11-14 17:51:25,234 INFO L273 TraceCheckUtils]: 42: Hoare triple {3563#false} assume true; {3563#false} is VALID [2018-11-14 17:51:25,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {3563#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3563#false} is VALID [2018-11-14 17:51:25,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {3563#false} is VALID [2018-11-14 17:51:25,251 INFO L273 TraceCheckUtils]: 39: Hoare triple {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} assume !!~bvslt32(~i~1, 5bv32); {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} is VALID [2018-11-14 17:51:25,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} assume true; {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} is VALID [2018-11-14 17:51:25,254 INFO L273 TraceCheckUtils]: 37: Hoare triple {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4077#(not (bvsgt rangesum_~i~1 (_ bv2 32)))} is VALID [2018-11-14 17:51:25,254 INFO L273 TraceCheckUtils]: 36: Hoare triple {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} assume !~bvsgt32(~i~1, 2bv32); {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} assume !!~bvslt32(~i~1, 5bv32); {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} assume true; {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,260 INFO L273 TraceCheckUtils]: 33: Hoare triple {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4087#(not (bvsgt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,260 INFO L273 TraceCheckUtils]: 32: Hoare triple {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} assume !~bvsgt32(~i~1, 2bv32); {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} assume !!~bvslt32(~i~1, 5bv32); {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} assume true; {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4100#(not (bvsgt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv2 32)))} is VALID [2018-11-14 17:51:25,262 INFO L256 TraceCheckUtils]: 28: Hoare triple {3562#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {3562#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {3562#true} {3562#true} #85#return; {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L273 TraceCheckUtils]: 25: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L273 TraceCheckUtils]: 24: Hoare triple {3562#true} assume !~bvslt32(~i~0, 5bv32); {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L273 TraceCheckUtils]: 23: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 17: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 16: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {3562#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {3562#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 7: Hoare triple {3562#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L256 TraceCheckUtils]: 6: Hoare triple {3562#true} call init_nondet(~#x~0.base, ~#x~0.offset); {3562#true} is VALID [2018-11-14 17:51:25,264 INFO L273 TraceCheckUtils]: 5: Hoare triple {3562#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {3562#true} is VALID [2018-11-14 17:51:25,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {3562#true} call #t~ret12 := main(); {3562#true} is VALID [2018-11-14 17:51:25,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3562#true} {3562#true} #81#return; {3562#true} is VALID [2018-11-14 17:51:25,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {3562#true} assume true; {3562#true} is VALID [2018-11-14 17:51:25,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {3562#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3562#true} is VALID [2018-11-14 17:51:25,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {3562#true} call ULTIMATE.init(); {3562#true} is VALID [2018-11-14 17:51:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 19 proven. 180 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-14 17:51:25,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:25,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 17:51:25,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-14 17:51:25,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:25,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:51:25,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:25,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:51:25,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:51:25,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:51:25,587 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 8 states. [2018-11-14 17:51:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:26,874 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-11-14 17:51:26,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:51:26,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 105 [2018-11-14 17:51:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:51:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-14 17:51:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:51:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2018-11-14 17:51:26,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 82 transitions. [2018-11-14 17:51:27,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:27,217 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:51:27,218 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:51:27,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:51:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:51:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-11-14 17:51:27,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:27,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 63 states. [2018-11-14 17:51:27,330 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 63 states. [2018-11-14 17:51:27,330 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 63 states. [2018-11-14 17:51:27,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:27,333 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 17:51:27,333 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 17:51:27,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:27,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:27,333 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 64 states. [2018-11-14 17:51:27,334 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 64 states. [2018-11-14 17:51:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:27,336 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-11-14 17:51:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-11-14 17:51:27,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:27,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:27,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:27,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:51:27,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-11-14 17:51:27,340 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 105 [2018-11-14 17:51:27,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:27,340 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-11-14 17:51:27,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:51:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-11-14 17:51:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 17:51:27,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:27,342 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 9, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:27,342 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:27,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:27,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2116337177, now seen corresponding path program 2 times [2018-11-14 17:51:27,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:27,343 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:27,365 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:29,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:51:29,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:29,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:29,906 INFO L256 TraceCheckUtils]: 0: Hoare triple {4541#true} call ULTIMATE.init(); {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L273 TraceCheckUtils]: 1: Hoare triple {4541#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L273 TraceCheckUtils]: 2: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4541#true} {4541#true} #81#return; {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L256 TraceCheckUtils]: 4: Hoare triple {4541#true} call #t~ret12 := main(); {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L273 TraceCheckUtils]: 5: Hoare triple {4541#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {4541#true} is VALID [2018-11-14 17:51:29,907 INFO L256 TraceCheckUtils]: 6: Hoare triple {4541#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 7: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 12: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 13: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:29,908 INFO L273 TraceCheckUtils]: 14: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 15: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 16: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 17: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 20: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:29,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {4541#true} assume !~bvslt32(~i~0, 5bv32); {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4541#true} {4541#true} #85#return; {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L273 TraceCheckUtils]: 27: Hoare triple {4541#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4541#true} is VALID [2018-11-14 17:51:29,910 INFO L256 TraceCheckUtils]: 28: Hoare triple {4541#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:29,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4633#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,911 INFO L273 TraceCheckUtils]: 30: Hoare triple {4633#(= (_ bv0 32) rangesum_~i~1)} assume true; {4633#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,911 INFO L273 TraceCheckUtils]: 31: Hoare triple {4633#(= (_ bv0 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {4633#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,912 INFO L273 TraceCheckUtils]: 32: Hoare triple {4633#(= (_ bv0 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {4633#(= (_ bv0 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,912 INFO L273 TraceCheckUtils]: 33: Hoare triple {4633#(= (_ bv0 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4646#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,912 INFO L273 TraceCheckUtils]: 34: Hoare triple {4646#(= (_ bv1 32) rangesum_~i~1)} assume true; {4646#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,913 INFO L273 TraceCheckUtils]: 35: Hoare triple {4646#(= (_ bv1 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {4646#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,913 INFO L273 TraceCheckUtils]: 36: Hoare triple {4646#(= (_ bv1 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {4646#(= (_ bv1 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,913 INFO L273 TraceCheckUtils]: 37: Hoare triple {4646#(= (_ bv1 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4659#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,914 INFO L273 TraceCheckUtils]: 38: Hoare triple {4659#(= (_ bv2 32) rangesum_~i~1)} assume true; {4659#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {4659#(= (_ bv2 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {4659#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {4659#(= (_ bv2 32) rangesum_~i~1)} assume !~bvsgt32(~i~1, 2bv32); {4659#(= (_ bv2 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {4659#(= (_ bv2 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4672#(= (_ bv3 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,964 INFO L273 TraceCheckUtils]: 42: Hoare triple {4672#(= (_ bv3 32) rangesum_~i~1)} assume true; {4672#(= (_ bv3 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,977 INFO L273 TraceCheckUtils]: 43: Hoare triple {4672#(= (_ bv3 32) rangesum_~i~1)} assume !!~bvslt32(~i~1, 5bv32); {4672#(= (_ bv3 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {4672#(= (_ bv3 32) rangesum_~i~1)} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {4672#(= (_ bv3 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {4672#(= (_ bv3 32) rangesum_~i~1)} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4685#(= (_ bv4 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,989 INFO L273 TraceCheckUtils]: 46: Hoare triple {4685#(= (_ bv4 32) rangesum_~i~1)} assume true; {4685#(= (_ bv4 32) rangesum_~i~1)} is VALID [2018-11-14 17:51:29,989 INFO L273 TraceCheckUtils]: 47: Hoare triple {4685#(= (_ bv4 32) rangesum_~i~1)} assume !~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {4542#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4542#false} is VALID [2018-11-14 17:51:29,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4542#false} {4541#true} #87#return; {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {4542#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L256 TraceCheckUtils]: 52: Hoare triple {4542#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L273 TraceCheckUtils]: 53: Hoare triple {4542#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L273 TraceCheckUtils]: 54: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,990 INFO L273 TraceCheckUtils]: 55: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,991 INFO L273 TraceCheckUtils]: 56: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,991 INFO L273 TraceCheckUtils]: 57: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,991 INFO L273 TraceCheckUtils]: 58: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,991 INFO L273 TraceCheckUtils]: 59: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,991 INFO L273 TraceCheckUtils]: 60: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 61: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 62: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 63: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 64: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 65: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,992 INFO L273 TraceCheckUtils]: 66: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 67: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 68: Hoare triple {4542#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 69: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 70: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 71: Hoare triple {4542#false} assume !~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,993 INFO L273 TraceCheckUtils]: 72: Hoare triple {4542#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L273 TraceCheckUtils]: 73: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4542#false} {4542#false} #89#return; {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L273 TraceCheckUtils]: 75: Hoare triple {4542#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L273 TraceCheckUtils]: 76: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L273 TraceCheckUtils]: 77: Hoare triple {4542#false} assume !~bvslt32(~i~2, 4bv32); {4542#false} is VALID [2018-11-14 17:51:29,994 INFO L273 TraceCheckUtils]: 78: Hoare triple {4542#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L256 TraceCheckUtils]: 79: Hoare triple {4542#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L273 TraceCheckUtils]: 80: Hoare triple {4542#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L273 TraceCheckUtils]: 81: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L273 TraceCheckUtils]: 82: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L273 TraceCheckUtils]: 83: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,995 INFO L273 TraceCheckUtils]: 84: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 85: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 86: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 87: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 88: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 89: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,996 INFO L273 TraceCheckUtils]: 90: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 91: Hoare triple {4542#false} assume !~bvsgt32(~i~1, 2bv32); {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 92: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 93: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 94: Hoare triple {4542#false} assume !!~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 95: Hoare triple {4542#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {4542#false} is VALID [2018-11-14 17:51:29,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {4542#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L273 TraceCheckUtils]: 97: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L273 TraceCheckUtils]: 98: Hoare triple {4542#false} assume !~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L273 TraceCheckUtils]: 99: Hoare triple {4542#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L273 TraceCheckUtils]: 100: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {4542#false} {4542#false} #91#return; {4542#false} is VALID [2018-11-14 17:51:29,998 INFO L273 TraceCheckUtils]: 102: Hoare triple {4542#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4542#false} is VALID [2018-11-14 17:51:29,999 INFO L273 TraceCheckUtils]: 103: Hoare triple {4542#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4542#false} is VALID [2018-11-14 17:51:29,999 INFO L273 TraceCheckUtils]: 104: Hoare triple {4542#false} assume !false; {4542#false} is VALID [2018-11-14 17:51:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 166 proven. 32 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-11-14 17:51:30,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:30,290 INFO L273 TraceCheckUtils]: 104: Hoare triple {4542#false} assume !false; {4542#false} is VALID [2018-11-14 17:51:30,290 INFO L273 TraceCheckUtils]: 103: Hoare triple {4542#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {4542#false} is VALID [2018-11-14 17:51:30,290 INFO L273 TraceCheckUtils]: 102: Hoare triple {4542#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {4542#false} is VALID [2018-11-14 17:51:30,291 INFO L268 TraceCheckUtils]: 101: Hoare quadruple {4541#true} {4542#false} #91#return; {4542#false} is VALID [2018-11-14 17:51:30,291 INFO L273 TraceCheckUtils]: 100: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,291 INFO L273 TraceCheckUtils]: 99: Hoare triple {4541#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4541#true} is VALID [2018-11-14 17:51:30,291 INFO L273 TraceCheckUtils]: 98: Hoare triple {4541#true} assume !~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 97: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 96: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 95: Hoare triple {4541#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 94: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 93: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 92: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 91: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,292 INFO L273 TraceCheckUtils]: 90: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 89: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 88: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 87: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 86: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 85: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 84: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 83: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 82: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,293 INFO L273 TraceCheckUtils]: 81: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4541#true} is VALID [2018-11-14 17:51:30,294 INFO L256 TraceCheckUtils]: 79: Hoare triple {4542#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 78: Hoare triple {4542#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {4542#false} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {4542#false} assume !~bvslt32(~i~2, 4bv32); {4542#false} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {4542#false} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {4542#false} is VALID [2018-11-14 17:51:30,294 INFO L268 TraceCheckUtils]: 74: Hoare quadruple {4541#true} {4542#false} #89#return; {4542#false} is VALID [2018-11-14 17:51:30,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 72: Hoare triple {4541#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 71: Hoare triple {4541#true} assume !~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 70: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 69: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 68: Hoare triple {4541#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 67: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 66: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,295 INFO L273 TraceCheckUtils]: 65: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 63: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 62: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 61: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 60: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 59: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 58: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,296 INFO L273 TraceCheckUtils]: 57: Hoare triple {4541#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 56: Hoare triple {4541#true} assume !~bvsgt32(~i~1, 2bv32); {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 55: Hoare triple {4541#true} assume !!~bvslt32(~i~1, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 53: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L256 TraceCheckUtils]: 52: Hoare triple {4542#false} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {4542#false} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {4542#false} is VALID [2018-11-14 17:51:30,297 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4542#false} {4541#true} #87#return; {4542#false} is VALID [2018-11-14 17:51:30,297 INFO L273 TraceCheckUtils]: 49: Hoare triple {4542#false} assume true; {4542#false} is VALID [2018-11-14 17:51:30,298 INFO L273 TraceCheckUtils]: 48: Hoare triple {4542#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {4542#false} is VALID [2018-11-14 17:51:30,298 INFO L273 TraceCheckUtils]: 47: Hoare triple {5037#(bvslt rangesum_~i~1 (_ bv5 32))} assume !~bvslt32(~i~1, 5bv32); {4542#false} is VALID [2018-11-14 17:51:30,298 INFO L273 TraceCheckUtils]: 46: Hoare triple {5037#(bvslt rangesum_~i~1 (_ bv5 32))} assume true; {5037#(bvslt rangesum_~i~1 (_ bv5 32))} is VALID [2018-11-14 17:51:30,301 INFO L273 TraceCheckUtils]: 45: Hoare triple {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5037#(bvslt rangesum_~i~1 (_ bv5 32))} is VALID [2018-11-14 17:51:30,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,302 INFO L273 TraceCheckUtils]: 43: Hoare triple {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32); {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,303 INFO L273 TraceCheckUtils]: 42: Hoare triple {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} assume true; {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,306 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5044#(bvslt (bvadd rangesum_~i~1 (_ bv1 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,307 INFO L273 TraceCheckUtils]: 40: Hoare triple {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} assume !~bvsgt32(~i~1, 2bv32); {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,307 INFO L273 TraceCheckUtils]: 39: Hoare triple {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32); {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,307 INFO L273 TraceCheckUtils]: 38: Hoare triple {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} assume true; {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,311 INFO L273 TraceCheckUtils]: 37: Hoare triple {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5057#(bvslt (bvadd rangesum_~i~1 (_ bv2 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,311 INFO L273 TraceCheckUtils]: 36: Hoare triple {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} assume !~bvsgt32(~i~1, 2bv32); {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,311 INFO L273 TraceCheckUtils]: 35: Hoare triple {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32); {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} assume true; {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5070#(bvslt (bvadd rangesum_~i~1 (_ bv3 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,315 INFO L273 TraceCheckUtils]: 32: Hoare triple {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} assume !~bvsgt32(~i~1, 2bv32); {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,315 INFO L273 TraceCheckUtils]: 31: Hoare triple {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} assume !!~bvslt32(~i~1, 5bv32); {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,315 INFO L273 TraceCheckUtils]: 30: Hoare triple {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} assume true; {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {5083#(bvslt (bvadd rangesum_~i~1 (_ bv4 32)) (_ bv5 32))} is VALID [2018-11-14 17:51:30,316 INFO L256 TraceCheckUtils]: 28: Hoare triple {4541#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:30,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {4541#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {4541#true} is VALID [2018-11-14 17:51:30,316 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4541#true} {4541#true} #85#return; {4541#true} is VALID [2018-11-14 17:51:30,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {4541#true} assume !~bvslt32(~i~0, 5bv32); {4541#true} is VALID [2018-11-14 17:51:30,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 22: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 19: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 16: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:30,317 INFO L273 TraceCheckUtils]: 15: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 11: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {4541#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {4541#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 8: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {4541#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L256 TraceCheckUtils]: 6: Hoare triple {4541#true} call init_nondet(~#x~0.base, ~#x~0.offset); {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {4541#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L256 TraceCheckUtils]: 4: Hoare triple {4541#true} call #t~ret12 := main(); {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4541#true} {4541#true} #81#return; {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L273 TraceCheckUtils]: 2: Hoare triple {4541#true} assume true; {4541#true} is VALID [2018-11-14 17:51:30,319 INFO L273 TraceCheckUtils]: 1: Hoare triple {4541#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4541#true} is VALID [2018-11-14 17:51:30,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {4541#true} call ULTIMATE.init(); {4541#true} is VALID [2018-11-14 17:51:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-14 17:51:30,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:30,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:51:30,339 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-11-14 17:51:30,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:30,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:51:30,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:30,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:51:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:51:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:51:30,716 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states. [2018-11-14 17:51:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:32,789 INFO L93 Difference]: Finished difference Result 107 states and 124 transitions. [2018-11-14 17:51:32,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 17:51:32,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-11-14 17:51:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:51:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2018-11-14 17:51:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:51:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2018-11-14 17:51:32,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2018-11-14 17:51:33,172 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 17:51:33,175 INFO L225 Difference]: With dead ends: 107 [2018-11-14 17:51:33,175 INFO L226 Difference]: Without dead ends: 73 [2018-11-14 17:51:33,176 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:51:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-14 17:51:33,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-11-14 17:51:33,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:33,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 72 states. [2018-11-14 17:51:33,206 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 72 states. [2018-11-14 17:51:33,206 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 72 states. [2018-11-14 17:51:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:33,209 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-14 17:51:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-14 17:51:33,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:33,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:33,210 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 73 states. [2018-11-14 17:51:33,210 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 73 states. [2018-11-14 17:51:33,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:33,213 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-11-14 17:51:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-11-14 17:51:33,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:33,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:33,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:33,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 17:51:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2018-11-14 17:51:33,217 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 105 [2018-11-14 17:51:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:33,217 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2018-11-14 17:51:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:51:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2018-11-14 17:51:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 17:51:33,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:33,219 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 9, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:33,219 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:33,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:33,219 INFO L82 PathProgramCache]: Analyzing trace with hash -644570466, now seen corresponding path program 3 times [2018-11-14 17:51:33,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:33,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:33,242 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:51:34,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:51:34,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:51:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:35,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:35,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {5568#true} call ULTIMATE.init(); {5568#true} is VALID [2018-11-14 17:51:35,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {5568#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5568#true} is VALID [2018-11-14 17:51:35,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5568#true} {5568#true} #81#return; {5568#true} is VALID [2018-11-14 17:51:35,410 INFO L256 TraceCheckUtils]: 4: Hoare triple {5568#true} call #t~ret12 := main(); {5568#true} is VALID [2018-11-14 17:51:35,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {5568#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {5568#true} is VALID [2018-11-14 17:51:35,410 INFO L256 TraceCheckUtils]: 6: Hoare triple {5568#true} call init_nondet(~#x~0.base, ~#x~0.offset); {5568#true} is VALID [2018-11-14 17:51:35,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {5568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {5568#true} is VALID [2018-11-14 17:51:35,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {5568#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {5568#true} is VALID [2018-11-14 17:51:35,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {5568#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5568#true} is VALID [2018-11-14 17:51:35,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {5568#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {5568#true} is VALID [2018-11-14 17:51:35,411 INFO L273 TraceCheckUtils]: 13: Hoare triple {5568#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {5568#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 16: Hoare triple {5568#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 17: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 18: Hoare triple {5568#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 19: Hoare triple {5568#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 20: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {5568#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {5568#true} is VALID [2018-11-14 17:51:35,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {5568#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {5568#true} assume !~bvslt32(~i~0, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {5568#true} {5568#true} #85#return; {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {5568#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {5568#true} is VALID [2018-11-14 17:51:35,413 INFO L256 TraceCheckUtils]: 28: Hoare triple {5568#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {5568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 31: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 32: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 33: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,414 INFO L273 TraceCheckUtils]: 35: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 37: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 39: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 40: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 41: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 42: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {5568#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 46: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 47: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 48: Hoare triple {5568#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 49: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 50: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 51: Hoare triple {5568#true} assume !~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {5568#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {5568#true} {5568#true} #87#return; {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 55: Hoare triple {5568#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L256 TraceCheckUtils]: 56: Hoare triple {5568#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {5568#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 58: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 59: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,417 INFO L273 TraceCheckUtils]: 60: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 61: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 62: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 63: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 64: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 65: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {5568#true} assume !~bvsgt32(~i~1, 2bv32); {5568#true} is VALID [2018-11-14 17:51:35,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 72: Hoare triple {5568#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 75: Hoare triple {5568#true} assume !!~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 76: Hoare triple {5568#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5568#true} is VALID [2018-11-14 17:51:35,419 INFO L273 TraceCheckUtils]: 77: Hoare triple {5568#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L273 TraceCheckUtils]: 79: Hoare triple {5568#true} assume !~bvslt32(~i~1, 5bv32); {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {5568#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L273 TraceCheckUtils]: 81: Hoare triple {5568#true} assume true; {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {5568#true} {5568#true} #89#return; {5568#true} is VALID [2018-11-14 17:51:35,420 INFO L273 TraceCheckUtils]: 83: Hoare triple {5568#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {5822#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-14 17:51:35,421 INFO L273 TraceCheckUtils]: 84: Hoare triple {5822#(= main_~i~2 (_ bv0 32))} assume true; {5822#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-14 17:51:35,421 INFO L273 TraceCheckUtils]: 85: Hoare triple {5822#(= main_~i~2 (_ bv0 32))} assume !~bvslt32(~i~2, 4bv32); {5569#false} is VALID [2018-11-14 17:51:35,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {5569#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {5569#false} is VALID [2018-11-14 17:51:35,421 INFO L256 TraceCheckUtils]: 87: Hoare triple {5569#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 88: Hoare triple {5569#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 89: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 90: Hoare triple {5569#false} assume !!~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 91: Hoare triple {5569#false} assume !~bvsgt32(~i~1, 2bv32); {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 92: Hoare triple {5569#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 93: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 94: Hoare triple {5569#false} assume !!~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,422 INFO L273 TraceCheckUtils]: 95: Hoare triple {5569#false} assume !~bvsgt32(~i~1, 2bv32); {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 96: Hoare triple {5569#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 97: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 98: Hoare triple {5569#false} assume !!~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 99: Hoare triple {5569#false} assume !~bvsgt32(~i~1, 2bv32); {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 100: Hoare triple {5569#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 101: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 102: Hoare triple {5569#false} assume !!~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,423 INFO L273 TraceCheckUtils]: 103: Hoare triple {5569#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 104: Hoare triple {5569#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 105: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 106: Hoare triple {5569#false} assume !!~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 107: Hoare triple {5569#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 108: Hoare triple {5569#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 109: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 110: Hoare triple {5569#false} assume !~bvslt32(~i~1, 5bv32); {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 111: Hoare triple {5569#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {5569#false} is VALID [2018-11-14 17:51:35,424 INFO L273 TraceCheckUtils]: 112: Hoare triple {5569#false} assume true; {5569#false} is VALID [2018-11-14 17:51:35,425 INFO L268 TraceCheckUtils]: 113: Hoare quadruple {5569#false} {5569#false} #91#return; {5569#false} is VALID [2018-11-14 17:51:35,425 INFO L273 TraceCheckUtils]: 114: Hoare triple {5569#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {5569#false} is VALID [2018-11-14 17:51:35,425 INFO L273 TraceCheckUtils]: 115: Hoare triple {5569#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {5569#false} is VALID [2018-11-14 17:51:35,425 INFO L273 TraceCheckUtils]: 116: Hoare triple {5569#false} assume !false; {5569#false} is VALID [2018-11-14 17:51:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-11-14 17:51:35,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:51:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:51:35,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:51:35,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-14 17:51:35,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:35,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:51:35,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:35,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:51:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:51:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:35,665 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand 3 states. [2018-11-14 17:51:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:36,184 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-11-14 17:51:36,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:51:36,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-14 17:51:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:51:36,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:51:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2018-11-14 17:51:36,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2018-11-14 17:51:36,450 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 17:51:36,452 INFO L225 Difference]: With dead ends: 112 [2018-11-14 17:51:36,452 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 17:51:36,452 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:51:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 17:51:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-14 17:51:36,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:36,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 74 states. [2018-11-14 17:51:36,608 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 74 states. [2018-11-14 17:51:36,608 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 74 states. [2018-11-14 17:51:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:36,612 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-14 17:51:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-14 17:51:36,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:36,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:36,612 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 75 states. [2018-11-14 17:51:36,613 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 75 states. [2018-11-14 17:51:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:36,614 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-11-14 17:51:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-11-14 17:51:36,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:36,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:36,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:36,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:51:36,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-11-14 17:51:36,617 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 117 [2018-11-14 17:51:36,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:36,618 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-11-14 17:51:36,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:51:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-11-14 17:51:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-14 17:51:36,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:36,619 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 9, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1] [2018-11-14 17:51:36,619 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:36,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:36,620 INFO L82 PathProgramCache]: Analyzing trace with hash 418047701, now seen corresponding path program 1 times [2018-11-14 17:51:36,620 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:36,620 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:36,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:51:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:51:38,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:51:38,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {6316#true} call ULTIMATE.init(); {6316#true} is VALID [2018-11-14 17:51:38,251 INFO L273 TraceCheckUtils]: 1: Hoare triple {6316#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6316#true} is VALID [2018-11-14 17:51:38,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6316#true} {6316#true} #81#return; {6316#true} is VALID [2018-11-14 17:51:38,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {6316#true} call #t~ret12 := main(); {6316#true} is VALID [2018-11-14 17:51:38,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {6316#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L256 TraceCheckUtils]: 6: Hoare triple {6316#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L273 TraceCheckUtils]: 10: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 14: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 17: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 20: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 21: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {6316#true} assume !~bvslt32(~i~0, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6316#true} {6316#true} #85#return; {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {6316#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L256 TraceCheckUtils]: 28: Hoare triple {6316#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L273 TraceCheckUtils]: 29: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 34: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 35: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 36: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,256 INFO L273 TraceCheckUtils]: 37: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 38: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 39: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 40: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 41: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 42: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 43: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,257 INFO L273 TraceCheckUtils]: 44: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 46: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 48: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 49: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 50: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,258 INFO L273 TraceCheckUtils]: 51: Hoare triple {6316#true} assume !~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L273 TraceCheckUtils]: 52: Hoare triple {6316#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L273 TraceCheckUtils]: 53: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {6316#true} {6316#true} #87#return; {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L273 TraceCheckUtils]: 55: Hoare triple {6316#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L256 TraceCheckUtils]: 56: Hoare triple {6316#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,259 INFO L273 TraceCheckUtils]: 57: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 58: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 59: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 60: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 61: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 62: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 65: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 66: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 67: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 69: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 72: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 73: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,262 INFO L273 TraceCheckUtils]: 77: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,263 INFO L273 TraceCheckUtils]: 78: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,263 INFO L273 TraceCheckUtils]: 79: Hoare triple {6316#true} assume !~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {6316#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6316#true} is VALID [2018-11-14 17:51:38,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,263 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {6316#true} {6316#true} #89#return; {6316#true} is VALID [2018-11-14 17:51:38,264 INFO L273 TraceCheckUtils]: 83: Hoare triple {6316#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {6570#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-14 17:51:38,264 INFO L273 TraceCheckUtils]: 84: Hoare triple {6570#(= main_~i~2 (_ bv0 32))} assume true; {6570#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-14 17:51:38,265 INFO L273 TraceCheckUtils]: 85: Hoare triple {6570#(= main_~i~2 (_ bv0 32))} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {6570#(= main_~i~2 (_ bv0 32))} is VALID [2018-11-14 17:51:38,266 INFO L273 TraceCheckUtils]: 86: Hoare triple {6570#(= main_~i~2 (_ bv0 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {6580#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-14 17:51:38,266 INFO L273 TraceCheckUtils]: 87: Hoare triple {6580#(= (_ bv1 32) main_~i~2)} assume true; {6580#(= (_ bv1 32) main_~i~2)} is VALID [2018-11-14 17:51:38,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {6580#(= (_ bv1 32) main_~i~2)} assume !~bvslt32(~i~2, 4bv32); {6317#false} is VALID [2018-11-14 17:51:38,267 INFO L273 TraceCheckUtils]: 89: Hoare triple {6317#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {6317#false} is VALID [2018-11-14 17:51:38,267 INFO L256 TraceCheckUtils]: 90: Hoare triple {6317#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6317#false} is VALID [2018-11-14 17:51:38,267 INFO L273 TraceCheckUtils]: 91: Hoare triple {6317#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6317#false} is VALID [2018-11-14 17:51:38,267 INFO L273 TraceCheckUtils]: 92: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,268 INFO L273 TraceCheckUtils]: 93: Hoare triple {6317#false} assume !!~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,268 INFO L273 TraceCheckUtils]: 94: Hoare triple {6317#false} assume !~bvsgt32(~i~1, 2bv32); {6317#false} is VALID [2018-11-14 17:51:38,268 INFO L273 TraceCheckUtils]: 95: Hoare triple {6317#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6317#false} is VALID [2018-11-14 17:51:38,268 INFO L273 TraceCheckUtils]: 96: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,269 INFO L273 TraceCheckUtils]: 97: Hoare triple {6317#false} assume !!~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,269 INFO L273 TraceCheckUtils]: 98: Hoare triple {6317#false} assume !~bvsgt32(~i~1, 2bv32); {6317#false} is VALID [2018-11-14 17:51:38,269 INFO L273 TraceCheckUtils]: 99: Hoare triple {6317#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6317#false} is VALID [2018-11-14 17:51:38,269 INFO L273 TraceCheckUtils]: 100: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 101: Hoare triple {6317#false} assume !!~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 102: Hoare triple {6317#false} assume !~bvsgt32(~i~1, 2bv32); {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 103: Hoare triple {6317#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 104: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 105: Hoare triple {6317#false} assume !!~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,270 INFO L273 TraceCheckUtils]: 106: Hoare triple {6317#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 107: Hoare triple {6317#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 108: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 109: Hoare triple {6317#false} assume !!~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 110: Hoare triple {6317#false} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 111: Hoare triple {6317#false} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6317#false} is VALID [2018-11-14 17:51:38,271 INFO L273 TraceCheckUtils]: 112: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 113: Hoare triple {6317#false} assume !~bvslt32(~i~1, 5bv32); {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 114: Hoare triple {6317#false} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 115: Hoare triple {6317#false} assume true; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {6317#false} {6317#false} #91#return; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 117: Hoare triple {6317#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 118: Hoare triple {6317#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6317#false} is VALID [2018-11-14 17:51:38,272 INFO L273 TraceCheckUtils]: 119: Hoare triple {6317#false} assume !false; {6317#false} is VALID [2018-11-14 17:51:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 252 proven. 2 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2018-11-14 17:51:38,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:51:38,468 INFO L273 TraceCheckUtils]: 119: Hoare triple {6317#false} assume !false; {6317#false} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 118: Hoare triple {6317#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {6317#false} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 117: Hoare triple {6317#false} ~ret5~0 := #t~ret11;havoc #t~ret11; {6317#false} is VALID [2018-11-14 17:51:38,469 INFO L268 TraceCheckUtils]: 116: Hoare quadruple {6316#true} {6317#false} #91#return; {6317#false} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 115: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 114: Hoare triple {6316#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6316#true} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 113: Hoare triple {6316#true} assume !~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 112: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,469 INFO L273 TraceCheckUtils]: 111: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 110: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 109: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 108: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 107: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 106: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 105: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 104: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 103: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,470 INFO L273 TraceCheckUtils]: 102: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 101: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 100: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 99: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 98: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 97: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 96: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 95: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,471 INFO L273 TraceCheckUtils]: 94: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,472 INFO L273 TraceCheckUtils]: 93: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,472 INFO L273 TraceCheckUtils]: 92: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,472 INFO L273 TraceCheckUtils]: 91: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,472 INFO L256 TraceCheckUtils]: 90: Hoare triple {6317#false} call #t~ret11 := rangesum(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,472 INFO L273 TraceCheckUtils]: 89: Hoare triple {6317#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(16bv32, ~#x~0.offset), 4bv32); {6317#false} is VALID [2018-11-14 17:51:38,472 INFO L273 TraceCheckUtils]: 88: Hoare triple {6773#(bvslt main_~i~2 (_ bv4 32))} assume !~bvslt32(~i~2, 4bv32); {6317#false} is VALID [2018-11-14 17:51:38,474 INFO L273 TraceCheckUtils]: 87: Hoare triple {6773#(bvslt main_~i~2 (_ bv4 32))} assume true; {6773#(bvslt main_~i~2 (_ bv4 32))} is VALID [2018-11-14 17:51:38,475 INFO L273 TraceCheckUtils]: 86: Hoare triple {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} #t~post9 := ~i~2;~i~2 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {6773#(bvslt main_~i~2 (_ bv4 32))} is VALID [2018-11-14 17:51:38,475 INFO L273 TraceCheckUtils]: 85: Hoare triple {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} assume !!~bvslt32(~i~2, 4bv32);call #t~mem10 := read~intINTTYPE4(~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~2))), 4bv32);call write~intINTTYPE4(#t~mem10, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~i~2)), 4bv32);havoc #t~mem10; {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-14 17:51:38,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} assume true; {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-14 17:51:38,476 INFO L273 TraceCheckUtils]: 83: Hoare triple {6316#true} ~ret2~0 := #t~ret7;havoc #t~ret7;call #t~mem8 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem8;havoc #t~mem8;~i~2 := 0bv32; {6780#(bvslt (bvadd main_~i~2 (_ bv1 32)) (_ bv4 32))} is VALID [2018-11-14 17:51:38,476 INFO L268 TraceCheckUtils]: 82: Hoare quadruple {6316#true} {6316#true} #89#return; {6316#true} is VALID [2018-11-14 17:51:38,476 INFO L273 TraceCheckUtils]: 81: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,476 INFO L273 TraceCheckUtils]: 80: Hoare triple {6316#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6316#true} is VALID [2018-11-14 17:51:38,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {6316#true} assume !~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,477 INFO L273 TraceCheckUtils]: 77: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,477 INFO L273 TraceCheckUtils]: 74: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 72: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 71: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 70: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 69: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 68: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 67: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 65: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 64: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 63: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 62: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 61: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 60: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 59: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,479 INFO L273 TraceCheckUtils]: 58: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 57: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L256 TraceCheckUtils]: 56: Hoare triple {6316#true} call #t~ret7 := rangesum(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {6316#true} ~ret~1 := #t~ret4;havoc #t~ret4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem5;havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem6, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem6;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {6316#true} {6316#true} #87#return; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {6316#true} assume ~cnt~0 != 0bv32;#res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~cnt~0))[32:0]; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {6316#true} assume !~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 50: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,480 INFO L273 TraceCheckUtils]: 49: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 48: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 47: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 46: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 45: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 44: Hoare triple {6316#true} assume ~bvsgt32(~i~1, 2bv32);call #t~mem3 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~1)), 4bv32);~ret~0 := ~bvadd64(~ret~0, ~sign_extendFrom32To64(#t~mem3));havoc #t~mem3;~cnt~0 := ~bvadd32(1bv32, ~cnt~0); {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 43: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 42: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,481 INFO L273 TraceCheckUtils]: 41: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 40: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 39: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 37: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {6316#true} #t~post2 := ~i~1;~i~1 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {6316#true} assume !~bvsgt32(~i~1, 2bv32); {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {6316#true} assume !!~bvslt32(~i~1, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 29: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~1;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~cnt~0 := 0bv32;~i~1 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L256 TraceCheckUtils]: 28: Hoare triple {6316#true} call #t~ret4 := rangesum(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 27: Hoare triple {6316#true} havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6316#true} {6316#true} #85#return; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 25: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,483 INFO L273 TraceCheckUtils]: 24: Hoare triple {6316#true} assume !~bvslt32(~i~0, 5bv32); {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 23: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 21: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 20: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 18: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 15: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 10: Hoare triple {6316#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 9: Hoare triple {6316#true} assume !!~bvslt32(~i~0, 5bv32);call write~intINTTYPE4(#t~nondet1, ~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 8: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {6316#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;~i~0 := 0bv32; {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L256 TraceCheckUtils]: 6: Hoare triple {6316#true} call init_nondet(~#x~0.base, ~#x~0.offset); {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {6316#true} call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(20bv32); {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {6316#true} call #t~ret12 := main(); {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6316#true} {6316#true} #81#return; {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {6316#true} assume true; {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {6316#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6316#true} is VALID [2018-11-14 17:51:38,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {6316#true} call ULTIMATE.init(); {6316#true} is VALID [2018-11-14 17:51:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2018-11-14 17:51:38,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:51:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:51:38,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-11-14 17:51:38,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:51:38,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:51:38,721 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 17:51:38,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:51:38,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:51:38,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:51:38,722 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2018-11-14 17:51:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:39,429 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-11-14 17:51:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:51:39,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2018-11-14 17:51:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:51:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:51:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:51:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-14 17:51:39,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-14 17:51:39,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:51:39,730 INFO L225 Difference]: With dead ends: 120 [2018-11-14 17:51:39,730 INFO L226 Difference]: Without dead ends: 83 [2018-11-14 17:51:39,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:51:39,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-14 17:51:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-11-14 17:51:40,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:51:40,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand 83 states. [2018-11-14 17:51:40,274 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 17:51:40,274 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 17:51:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:40,276 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-11-14 17:51:40,277 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-14 17:51:40,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:40,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:40,277 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 83 states. [2018-11-14 17:51:40,278 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 83 states. [2018-11-14 17:51:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:51:40,280 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-11-14 17:51:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-14 17:51:40,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:51:40,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:51:40,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:51:40,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:51:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 17:51:40,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-11-14 17:51:40,283 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 120 [2018-11-14 17:51:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:51:40,284 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-11-14 17:51:40,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:51:40,284 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-11-14 17:51:40,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-14 17:51:40,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:51:40,286 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 9, 6, 6, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1] [2018-11-14 17:51:40,286 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:51:40,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:51:40,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1138840610, now seen corresponding path program 2 times [2018-11-14 17:51:40,287 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:51:40,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:51:40,315 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:51:43,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:51:43,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-14 17:51:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-14 17:51:47,475 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: rangesumENTRY has no Hoare annotation [2018-11-14 17:51:47,601 WARN L170 areAnnotationChecker]: init_nondetENTRY has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: L6-4 has no Hoare annotation [2018-11-14 17:51:47,602 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L17-5 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L17-5 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L6-5 has no Hoare annotation [2018-11-14 17:51:47,603 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: rangesumFINAL has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L6-3 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: init_nondetEXIT has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-14 17:51:47,604 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: rangesumEXIT has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L43-4 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2018-11-14 17:51:47,605 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L43-5 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 17:51:47,606 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 17:51:47,607 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 17:51:47,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 05:51:47 BoogieIcfgContainer [2018-11-14 17:51:47,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 17:51:47,611 INFO L168 Benchmark]: Toolchain (without parser) took 39051.21 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -904.7 MB). Peak memory consumption was 100.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:51:47,612 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:51:47,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 17:51:47,613 INFO L168 Benchmark]: Boogie Preprocessor took 55.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:51:47,614 INFO L168 Benchmark]: RCFGBuilder took 1381.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:51:47,614 INFO L168 Benchmark]: TraceAbstraction took 37230.95 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 260.6 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -140.9 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. [2018-11-14 17:51:47,617 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 375.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1381.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -774.4 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 37230.95 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 260.6 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -140.9 MB). Peak memory consumption was 119.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] FCALL int x[5]; VAL [x={8:0}] [L32] CALL init_nondet(x) VAL [x={8:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={8:0}, x={8:0}] [L6] COND TRUE i < 5 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={8:0}, x={8:0}] [L6] COND TRUE i < 5 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={8:0}, x={8:0}] [L6] COND TRUE i < 5 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={8:0}, x={8:0}] [L6] COND TRUE i < 5 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={8:0}, x={8:0}] [L6] COND TRUE i < 5 [L7] FCALL x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={8:0}, x={8:0}] [L6] COND FALSE, RET !(i < 5) VAL [i=5, x={8:0}, x={8:0}] [L32] init_nondet(x) VAL [x={8:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={8:0}] [L38] CALL, EXPR rangesum(x) VAL [x={8:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=18446744072666580992, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=1, i=4, ret=18446744072666580992, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=18446744072666580992, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=24938496, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; VAL [\result=12469248, cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L38] EXPR rangesum(x) VAL [rangesum(x)=12469248, x={8:0}] [L38] ret = rangesum(x) [L40] EXPR, FCALL x[0] [L40] temp=x[0] [L40] EXPR, FCALL x[1] [L40] FCALL x[0] = x[1] [L40] FCALL x[1] = temp VAL [ret=12469248, temp=0, x={8:0}] [L41] CALL, EXPR rangesum(x) VAL [x={8:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=18446744072666580992, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=1, i=4, ret=18446744072666580992, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=18446744072666580992, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=24938496, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; VAL [\result=12469248, cnt=2, i=5, ret=24938496, x={8:0}, x={8:0}] [L41] EXPR rangesum(x) VAL [rangesum(x)=12469248, ret=12469248, temp=0, x={8:0}] [L41] ret2 = rangesum(x) [L42] EXPR, FCALL x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L43] COND TRUE i<5 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ VAL [i=1, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L43] COND TRUE i<5 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ VAL [i=2, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L43] COND TRUE i<5 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ VAL [i=3, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L43] COND TRUE i<5 -1 [L44] EXPR, FCALL x[i+1] [L44] FCALL x[i] = x[i+1] [L43] i++ VAL [i=4, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L43] COND FALSE !(i<5 -1) VAL [i=4, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L46] FCALL x[5 -1] = temp VAL [i=4, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L47] CALL, EXPR rangesum(x) VAL [x={8:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=0, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=1, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L18] COND FALSE !(i > 5/2) VAL [cnt=0, i=2, ret=0, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=0, i=3, ret=0, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=3, ret=1067909120, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=1, i=4, ret=1067909120, x={8:0}, x={8:0}] [L17] COND TRUE i < 5 VAL [cnt=1, i=4, ret=1067909120, x={8:0}, x={8:0}] [L18] COND TRUE i > 5/2 [L19] EXPR, FCALL x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=4, ret=1071644672, x={8:0}, x={8:0}] [L17] i++ VAL [cnt=2, i=5, ret=1071644672, x={8:0}, x={8:0}] [L17] COND FALSE !(i < 5) VAL [cnt=2, i=5, ret=1071644672, x={8:0}, x={8:0}] [L23] COND TRUE cnt !=0 [L24] RET return ret / cnt; VAL [\result=535822336, cnt=2, i=5, ret=1071644672, x={8:0}, x={8:0}] [L47] EXPR rangesum(x) VAL [i=4, rangesum(x)=535822336, ret=12469248, ret2=12469248, temp=3735552, x={8:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=4, ret=12469248, ret2=12469248, ret5=535822336, temp=3735552, x={8:0}] [L50] __VERIFIER_error() VAL [i=4, ret=12469248, ret2=12469248, ret5=535822336, temp=3735552, x={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. UNSAFE Result, 37.1s OverallTime, 12 OverallIterations, 18 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 444 SDtfs, 51 SDslu, 1194 SDs, 0 SdLazy, 297 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1307 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 12 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 931 NumberOfCodeBlocks, 824 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1295 ConstructedInterpolants, 0 QuantifiedInterpolants, 146585 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 3229/3743 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...