java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum1_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:40:02,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:40:02,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:40:02,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:40:02,776 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:40:02,777 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:40:02,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:40:02,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:40:02,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:40:02,783 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:40:02,784 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:40:02,784 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:40:02,785 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:40:02,786 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:40:02,787 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:40:02,788 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:40:02,788 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:40:02,790 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:40:02,792 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:40:02,794 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:40:02,795 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:40:02,796 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:40:02,798 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:40:02,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:40:02,799 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:40:02,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:40:02,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:40:02,801 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:40:02,802 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:40:02,803 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:40:02,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:40:02,804 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:40:02,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:40:02,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:40:02,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:40:02,806 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:40:02,807 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:40:02,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:40:02,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:40:02,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:40:02,829 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:40:02,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:40:02,830 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:40:02,830 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:40:02,830 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:40:02,830 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:40:02,831 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:40:02,832 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:40:02,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:40:02,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:40:02,832 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:40:02,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:40:02,833 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:40:02,833 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:40:02,833 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:40:02,833 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:40:02,833 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:40:02,834 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:40:02,834 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:40:02,834 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:40:02,834 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:40:02,834 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:40:02,835 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:40:02,835 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:40:02,835 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:40:02,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:40:02,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:40:02,913 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:40:02,915 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:40:02,915 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:40:02,916 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum1_true-unreach-call.c [2018-11-23 10:40:02,978 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07fd332/44dd137752e844fba1becc71a3076734/FLAG792a2e973 [2018-11-23 10:40:03,463 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:40:03,464 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum1_true-unreach-call.c [2018-11-23 10:40:03,469 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07fd332/44dd137752e844fba1becc71a3076734/FLAG792a2e973 [2018-11-23 10:40:03,804 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07fd332/44dd137752e844fba1becc71a3076734 [2018-11-23 10:40:03,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:40:03,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:40:03,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:40:03,817 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:40:03,820 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:40:03,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:40:03" (1/1) ... [2018-11-23 10:40:03,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cbf194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:03, skipping insertion in model container [2018-11-23 10:40:03,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:40:03" (1/1) ... [2018-11-23 10:40:03,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:40:03,852 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:40:04,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:40:04,080 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:40:04,105 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:40:04,130 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:40:04,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04 WrapperNode [2018-11-23 10:40:04,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:40:04,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:40:04,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:40:04,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:40:04,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:40:04,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:40:04,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:40:04,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:40:04,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... [2018-11-23 10:40:04,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:40:04,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:40:04,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:40:04,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:40:04,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:40:04,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:40:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:40:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:40:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-23 10:40:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:40:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:40:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:40:04,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:40:04,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:40:04,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:40:04,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:40:04,800 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:40:04,801 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:40:04,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:40:04 BoogieIcfgContainer [2018-11-23 10:40:04,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:40:04,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:40:04,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:40:04,806 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:40:04,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:40:03" (1/3) ... [2018-11-23 10:40:04,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461545fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:40:04, skipping insertion in model container [2018-11-23 10:40:04,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:04" (2/3) ... [2018-11-23 10:40:04,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461545fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:40:04, skipping insertion in model container [2018-11-23 10:40:04,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:40:04" (3/3) ... [2018-11-23 10:40:04,810 INFO L112 eAbstractionObserver]: Analyzing ICFG zero_sum1_true-unreach-call.c [2018-11-23 10:40:04,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:40:04,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:40:04,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:40:04,875 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:40:04,876 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:40:04,876 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:40:04,876 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:40:04,876 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:40:04,876 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:40:04,876 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:40:04,876 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:40:04,877 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:40:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 10:40:04,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:40:04,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:04,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:04,903 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:04,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash -513166855, now seen corresponding path program 1 times [2018-11-23 10:40:04,912 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:04,912 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:04,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:04,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:05,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 10:40:05,084 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {28#true} is VALID [2018-11-23 10:40:05,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 10:40:05,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 10:40:05,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2018-11-23 10:40:05,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2018-11-23 10:40:05,086 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {28#true} is VALID [2018-11-23 10:40:05,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 10:40:05,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} ~i~0 := 0bv32; {29#false} is VALID [2018-11-23 10:40:05,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 10:40:05,088 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 10:40:05,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 10:40:05,089 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 10:40:05,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 10:40:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:05,093 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:05,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:05,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:40:05,103 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:40:05,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:05,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:40:05,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:05,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:40:05,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:40:05,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:40:05,220 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 10:40:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:05,480 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 10:40:05,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:40:05,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:40:05,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:40:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:40:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:40:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 10:40:05,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 10:40:05,673 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:05,693 INFO L225 Difference]: With dead ends: 41 [2018-11-23 10:40:05,693 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 10:40:05,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:40:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 10:40:05,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 10:40:05,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:05,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 10:40:05,779 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 10:40:05,779 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 10:40:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:05,782 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 10:40:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 10:40:05,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:05,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:05,784 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 10:40:05,784 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 10:40:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:05,790 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 10:40:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 10:40:05,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:05,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:05,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:05,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 10:40:05,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 10:40:05,798 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-11-23 10:40:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:05,798 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 10:40:05,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:40:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 10:40:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:40:05,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:05,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:05,800 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:05,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1548762771, now seen corresponding path program 1 times [2018-11-23 10:40:05,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:05,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:05,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:06,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {182#true} call ULTIMATE.init(); {182#true} is VALID [2018-11-23 10:40:06,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {182#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {182#true} is VALID [2018-11-23 10:40:06,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {182#true} assume true; {182#true} is VALID [2018-11-23 10:40:06,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} #55#return; {182#true} is VALID [2018-11-23 10:40:06,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {182#true} call #t~ret6 := main(); {182#true} is VALID [2018-11-23 10:40:06,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {182#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {182#true} is VALID [2018-11-23 10:40:06,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:06,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:06,051 INFO L273 TraceCheckUtils]: 8: Hoare triple {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} ~i~0 := 0bv32; {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:06,051 INFO L273 TraceCheckUtils]: 9: Hoare triple {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:06,070 INFO L256 TraceCheckUtils]: 10: Hoare triple {205#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {218#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:06,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {218#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {222#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:06,099 INFO L273 TraceCheckUtils]: 12: Hoare triple {222#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {183#false} is VALID [2018-11-23 10:40:06,099 INFO L273 TraceCheckUtils]: 13: Hoare triple {183#false} assume !false; {183#false} is VALID [2018-11-23 10:40:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:06,101 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:06,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:06,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 10:40:06,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 10:40:06,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:06,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 10:40:06,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:06,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 10:40:06,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 10:40:06,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 10:40:06,144 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2018-11-23 10:40:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:06,694 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 10:40:06,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:40:06,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 10:40:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:06,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:40:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 10:40:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:40:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2018-11-23 10:40:06,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2018-11-23 10:40:06,753 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:06,758 INFO L225 Difference]: With dead ends: 25 [2018-11-23 10:40:06,758 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 10:40:06,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 10:40:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 10:40:06,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:06,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 10:40:06,780 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:40:06,780 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:40:06,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:06,782 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:40:06,782 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:40:06,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:06,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:06,783 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 10:40:06,783 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 10:40:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:06,786 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 10:40:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:40:06,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:06,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:06,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:06,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:40:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 10:40:06,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 14 [2018-11-23 10:40:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:06,789 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 10:40:06,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 10:40:06,790 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 10:40:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:40:06,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:06,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:06,791 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:06,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash -587884629, now seen corresponding path program 1 times [2018-11-23 10:40:06,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:06,792 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:06,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:06,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:07,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2018-11-23 10:40:07,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {337#true} is VALID [2018-11-23 10:40:07,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-23 10:40:07,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} #55#return; {337#true} is VALID [2018-11-23 10:40:07,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {337#true} call #t~ret6 := main(); {337#true} is VALID [2018-11-23 10:40:07,112 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {337#true} is VALID [2018-11-23 10:40:07,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {360#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:07,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {360#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {360#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:07,122 INFO L273 TraceCheckUtils]: 8: Hoare triple {360#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {367#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:07,129 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {338#false} is VALID [2018-11-23 10:40:07,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#false} ~i~0 := 0bv32; {338#false} is VALID [2018-11-23 10:40:07,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#false} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {338#false} is VALID [2018-11-23 10:40:07,130 INFO L256 TraceCheckUtils]: 12: Hoare triple {338#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {338#false} is VALID [2018-11-23 10:40:07,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {338#false} ~cond := #in~cond; {338#false} is VALID [2018-11-23 10:40:07,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {338#false} assume 0bv32 == ~cond; {338#false} is VALID [2018-11-23 10:40:07,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {338#false} assume !false; {338#false} is VALID [2018-11-23 10:40:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:07,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:07,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {338#false} assume !false; {338#false} is VALID [2018-11-23 10:40:07,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {338#false} assume 0bv32 == ~cond; {338#false} is VALID [2018-11-23 10:40:07,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {338#false} ~cond := #in~cond; {338#false} is VALID [2018-11-23 10:40:07,255 INFO L256 TraceCheckUtils]: 12: Hoare triple {338#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {338#false} is VALID [2018-11-23 10:40:07,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#false} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {338#false} is VALID [2018-11-23 10:40:07,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {338#false} ~i~0 := 0bv32; {338#false} is VALID [2018-11-23 10:40:07,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {407#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {338#false} is VALID [2018-11-23 10:40:07,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {407#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:07,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {411#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:07,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {337#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {411#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:07,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {337#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {337#true} is VALID [2018-11-23 10:40:07,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {337#true} call #t~ret6 := main(); {337#true} is VALID [2018-11-23 10:40:07,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {337#true} {337#true} #55#return; {337#true} is VALID [2018-11-23 10:40:07,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {337#true} assume true; {337#true} is VALID [2018-11-23 10:40:07,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {337#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {337#true} is VALID [2018-11-23 10:40:07,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {337#true} call ULTIMATE.init(); {337#true} is VALID [2018-11-23 10:40:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:07,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:07,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:40:07,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:40:07,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:07,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:40:07,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:07,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:40:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:40:07,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:07,417 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-11-23 10:40:07,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:07,699 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 10:40:07,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:40:07,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 10:40:07,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:40:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-23 10:40:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:40:07,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-23 10:40:07,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2018-11-23 10:40:07,771 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-23 10:40:07,772 INFO L225 Difference]: With dead ends: 31 [2018-11-23 10:40:07,772 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 10:40:07,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 10:40:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 10:40:07,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:07,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 10:40:07,793 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 10:40:07,793 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 10:40:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:07,795 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 10:40:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:40:07,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:07,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:07,796 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 10:40:07,796 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 10:40:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:07,798 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 10:40:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:40:07,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:07,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:07,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:07,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:40:07,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 10:40:07,801 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 10:40:07,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:07,802 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 10:40:07,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:40:07,802 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 10:40:07,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:40:07,803 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:07,803 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:07,803 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:07,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:07,804 INFO L82 PathProgramCache]: Analyzing trace with hash -601958807, now seen corresponding path program 2 times [2018-11-23 10:40:07,804 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:07,804 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:07,829 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:40:07,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:40:07,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:07,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:08,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {555#true} call ULTIMATE.init(); {555#true} is VALID [2018-11-23 10:40:08,037 INFO L273 TraceCheckUtils]: 1: Hoare triple {555#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {555#true} is VALID [2018-11-23 10:40:08,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {555#true} assume true; {555#true} is VALID [2018-11-23 10:40:08,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {555#true} {555#true} #55#return; {555#true} is VALID [2018-11-23 10:40:08,038 INFO L256 TraceCheckUtils]: 4: Hoare triple {555#true} call #t~ret6 := main(); {555#true} is VALID [2018-11-23 10:40:08,038 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {555#true} is VALID [2018-11-23 10:40:08,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {555#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,088 INFO L273 TraceCheckUtils]: 10: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} is VALID [2018-11-23 10:40:08,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {578#(bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32))} ~i~0 := 0bv32; {597#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,093 INFO L273 TraceCheckUtils]: 13: Hoare triple {597#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {556#false} is VALID [2018-11-23 10:40:08,093 INFO L256 TraceCheckUtils]: 14: Hoare triple {556#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {556#false} is VALID [2018-11-23 10:40:08,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {556#false} ~cond := #in~cond; {556#false} is VALID [2018-11-23 10:40:08,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {556#false} assume 0bv32 == ~cond; {556#false} is VALID [2018-11-23 10:40:08,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {556#false} assume !false; {556#false} is VALID [2018-11-23 10:40:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:40:08,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:08,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:08,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:40:08,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 10:40:08,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:08,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:40:08,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:08,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:40:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:40:08,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:40:08,124 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-11-23 10:40:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:08,287 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 10:40:08,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:40:08,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 10:40:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:40:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 10:40:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:40:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-23 10:40:08,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2018-11-23 10:40:08,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:08,377 INFO L225 Difference]: With dead ends: 27 [2018-11-23 10:40:08,378 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:40:08,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:40:08,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:40:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 10:40:08,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:08,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 10:40:08,405 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 10:40:08,405 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 10:40:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:08,407 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:40:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:40:08,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:08,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:08,409 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 10:40:08,409 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 10:40:08,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:08,411 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 10:40:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 10:40:08,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:08,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:08,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:08,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:08,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:40:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 10:40:08,413 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 10:40:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:08,414 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 10:40:08,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:40:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 10:40:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:40:08,415 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:08,415 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:08,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:08,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1939645081, now seen corresponding path program 1 times [2018-11-23 10:40:08,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:08,417 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:08,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:40:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:08,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:08,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 10:40:08,717 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {728#true} is VALID [2018-11-23 10:40:08,718 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 10:40:08,718 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #55#return; {728#true} is VALID [2018-11-23 10:40:08,718 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret6 := main(); {728#true} is VALID [2018-11-23 10:40:08,718 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {728#true} is VALID [2018-11-23 10:40:08,728 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {751#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {751#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {751#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {751#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {758#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:08,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {758#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {758#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:08,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {758#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {765#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:08,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {765#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {769#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {769#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} ~i~0 := 0bv32; {773#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {773#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {773#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:08,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {773#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {780#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:08,738 INFO L273 TraceCheckUtils]: 15: Hoare triple {780#(and (not (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {729#false} is VALID [2018-11-23 10:40:08,738 INFO L256 TraceCheckUtils]: 16: Hoare triple {729#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {729#false} is VALID [2018-11-23 10:40:08,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~cond := #in~cond; {729#false} is VALID [2018-11-23 10:40:08,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume 0bv32 == ~cond; {729#false} is VALID [2018-11-23 10:40:08,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 10:40:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:08,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:09,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {729#false} assume !false; {729#false} is VALID [2018-11-23 10:40:09,158 INFO L273 TraceCheckUtils]: 18: Hoare triple {729#false} assume 0bv32 == ~cond; {729#false} is VALID [2018-11-23 10:40:09,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {729#false} ~cond := #in~cond; {729#false} is VALID [2018-11-23 10:40:09,159 INFO L256 TraceCheckUtils]: 16: Hoare triple {729#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {729#false} is VALID [2018-11-23 10:40:09,168 INFO L273 TraceCheckUtils]: 15: Hoare triple {808#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {729#false} is VALID [2018-11-23 10:40:09,174 INFO L273 TraceCheckUtils]: 14: Hoare triple {812#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {808#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:09,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {812#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:09,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {819#(bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0))} ~i~0 := 0bv32; {812#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:09,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {823#(or (bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0)) (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {819#(bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:09,193 INFO L273 TraceCheckUtils]: 10: Hoare triple {827#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {823#(or (bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0)) (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)))} is VALID [2018-11-23 10:40:09,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {827#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {827#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0)))} is VALID [2018-11-23 10:40:09,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {827#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0)))} is VALID [2018-11-23 10:40:09,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {834#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {834#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0)))} is VALID [2018-11-23 10:40:09,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {728#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {834#(or (bvslt (_ bv1 32) ((_ sign_extend 16) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0)))} is VALID [2018-11-23 10:40:09,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {728#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {728#true} is VALID [2018-11-23 10:40:09,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {728#true} call #t~ret6 := main(); {728#true} is VALID [2018-11-23 10:40:09,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {728#true} {728#true} #55#return; {728#true} is VALID [2018-11-23 10:40:09,218 INFO L273 TraceCheckUtils]: 2: Hoare triple {728#true} assume true; {728#true} is VALID [2018-11-23 10:40:09,218 INFO L273 TraceCheckUtils]: 1: Hoare triple {728#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {728#true} is VALID [2018-11-23 10:40:09,218 INFO L256 TraceCheckUtils]: 0: Hoare triple {728#true} call ULTIMATE.init(); {728#true} is VALID [2018-11-23 10:40:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:09,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:09,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:40:09,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 10:40:09,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:09,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:40:09,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:09,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:40:09,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:40:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:40:09,308 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 14 states. [2018-11-23 10:40:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:10,107 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 10:40:10,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:40:10,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 20 [2018-11-23 10:40:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:40:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-23 10:40:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:40:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2018-11-23 10:40:10,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2018-11-23 10:40:10,211 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-23 10:40:10,213 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:40:10,213 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:40:10,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:40:10,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:40:10,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-11-23 10:40:10,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:10,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 31 states. [2018-11-23 10:40:10,242 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 31 states. [2018-11-23 10:40:10,242 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 31 states. [2018-11-23 10:40:10,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:10,245 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 10:40:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 10:40:10,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:10,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:10,247 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 40 states. [2018-11-23 10:40:10,247 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 40 states. [2018-11-23 10:40:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:10,249 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 10:40:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 10:40:10,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:10,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:10,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:10,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:10,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:40:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 10:40:10,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-23 10:40:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:10,253 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 10:40:10,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:40:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 10:40:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:40:10,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:10,255 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:10,255 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:10,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1034034405, now seen corresponding path program 2 times [2018-11-23 10:40:10,256 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:10,256 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:10,273 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:40:10,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:40:10,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:10,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:10,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-11-23 10:40:11,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:40:11,014 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:40:11,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-11-23 10:40:11,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:11,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:11,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:11,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:29 [2018-11-23 10:40:11,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2018-11-23 10:40:11,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {1063#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {1063#true} is VALID [2018-11-23 10:40:11,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2018-11-23 10:40:11,275 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #55#return; {1063#true} is VALID [2018-11-23 10:40:11,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret6 := main(); {1063#true} is VALID [2018-11-23 10:40:11,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {1063#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1063#true} is VALID [2018-11-23 10:40:11,289 INFO L273 TraceCheckUtils]: 6: Hoare triple {1063#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1086#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-23 10:40:11,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {1086#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1090#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:11,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {1090#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1094#(and (= (bvadd ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:11,293 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#(and (= (bvadd ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:11,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:11,298 INFO L273 TraceCheckUtils]: 11: Hoare triple {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:11,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {1098#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {1108#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:11,337 INFO L273 TraceCheckUtils]: 13: Hoare triple {1108#(and (= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1112#(and (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:11,338 INFO L273 TraceCheckUtils]: 14: Hoare triple {1112#(and (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1116#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:11,339 INFO L273 TraceCheckUtils]: 15: Hoare triple {1116#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1120#(and (exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:11,340 INFO L273 TraceCheckUtils]: 16: Hoare triple {1120#(and (exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1124#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-23 10:40:11,341 INFO L273 TraceCheckUtils]: 17: Hoare triple {1124#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32)))))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1124#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-23 10:40:11,343 INFO L256 TraceCheckUtils]: 18: Hoare triple {1124#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_2))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_3)))) ((_ sign_extend 32) (_ bv0 32)))))} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {1131#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:11,346 INFO L273 TraceCheckUtils]: 19: Hoare triple {1131#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1135#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:11,347 INFO L273 TraceCheckUtils]: 20: Hoare triple {1135#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1064#false} is VALID [2018-11-23 10:40:11,347 INFO L273 TraceCheckUtils]: 21: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2018-11-23 10:40:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:11,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:12,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-23 10:40:12,596 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:40:12,611 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:40:12,656 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-11-23 10:40:12,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 95 [2018-11-23 10:40:12,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 33 dim-0 vars, End of recursive call: 33 dim-0 vars, and 16 xjuncts. [2018-11-23 10:40:13,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 25 dim-0 vars, and 10 xjuncts. [2018-11-23 10:40:14,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 25 dim-0 vars, and 10 xjuncts. [2018-11-23 10:40:14,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:408 [2018-11-23 10:40:29,801 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:40:29,802 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (let ((.cse1 (bvmul (_ bv2 32) main_~i~0)) (.cse0 (select |#memory_int| |main_~#a~0.base|))) (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |main_~#a~0.offset| .cse1))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 |main_~#a~0.offset|))))) main_~sum~0 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv2 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select .cse0 (bvadd |main_~#a~0.offset| (_ bv2 32))))))))) ((_ sign_extend 32) (_ bv0 32))) [2018-11-23 10:40:29,802 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_9, v_prenex_11, v_prenex_12, v_prenex_10, v_prenex_28, v_prenex_29, v_prenex_27, v_prenex_15, v_arrayElimCell_8, v_prenex_3, v_prenex_4, v_prenex_25, v_prenex_26, v_prenex_16, v_prenex_17, v_prenex_13, v_prenex_14, v_prenex_6, v_prenex_7, v_prenex_8, v_prenex_1, v_prenex_2, v_arrayElimCell_6, v_prenex_20, v_prenex_19]. (let ((.cse17 (bvmul (_ bv2 32) main_~i~0))) (let ((.cse14 (bvadd |main_~#a~0.offset| (_ bv2 32))) (.cse15 (bvadd |main_~#a~0.offset| .cse17 (_ bv2 32))) (.cse16 (bvadd |main_~#a~0.offset| .cse17))) (let ((.cse6 (= |main_~#a~0.offset| .cse16)) (.cse4 (= |main_~#a~0.offset| .cse15)) (.cse0 (= .cse16 .cse14)) (.cse1 (= .cse14 .cse15)) (.cse3 ((_ sign_extend 32) (_ bv0 32)))) (and (or .cse0 .cse1 (= (let ((.cse2 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_29))))) (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_28))) .cse2 main_~sum~0 (bvneg .cse2) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_27)))))) .cse3) .cse4) (or .cse0 .cse1 (= (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_9)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_11))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_12))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_10))))) .cse3) .cse4) (= (let ((.cse5 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_15))))) (bvadd (bvmul (_ bv2 64) .cse5) main_~sum~0 (bvmul (_ bv2 64) (bvneg .cse5)))) .cse3) (or .cse6 (= (let ((.cse7 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_3))))) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_8)))) .cse7 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_4))) main_~sum~0 (bvneg .cse7))) .cse3) .cse0 .cse4) (or .cse6 (= (let ((.cse8 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_26))))) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_25)))) (bvmul (_ bv2 64) .cse8) main_~sum~0 (bvneg .cse8))) .cse3) .cse4) (or (= .cse3 (let ((.cse9 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_17))))) (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_16))) .cse9 main_~sum~0 (bvmul (_ bv2 64) (bvneg .cse9))))) .cse1 .cse4) (or .cse6 .cse0 (= (let ((.cse10 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_13))))) (bvadd .cse10 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_14))) main_~sum~0 (bvmul (_ bv2 64) (bvneg .cse10)))) .cse3)) (or (= (let ((.cse11 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_8))))) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_6)))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_7))) .cse11 main_~sum~0 (bvneg .cse11))) .cse3) .cse1 .cse4) (or (= (let ((.cse12 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_1))))) (bvadd .cse12 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_2))) main_~sum~0 (bvneg .cse12) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_6)))))) .cse3) .cse0 .cse1) (or .cse0 .cse1 (= (let ((.cse13 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_20))))) (bvadd (bvmul (_ bv2 64) .cse13) main_~sum~0 (bvneg .cse13) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_19)))))) .cse3)))))) [2018-11-23 10:40:37,104 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 175 DAG size of output: 19 [2018-11-23 10:40:37,236 INFO L273 TraceCheckUtils]: 21: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2018-11-23 10:40:37,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {1145#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1064#false} is VALID [2018-11-23 10:40:37,238 INFO L273 TraceCheckUtils]: 19: Hoare triple {1149#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1145#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:40:37,239 INFO L256 TraceCheckUtils]: 18: Hoare triple {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {1149#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:40:37,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:37,241 INFO L273 TraceCheckUtils]: 16: Hoare triple {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:37,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {1163#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1153#(= main_~sum~0 ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:39,247 INFO L273 TraceCheckUtils]: 14: Hoare triple {1167#(= (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))))) ((_ sign_extend 32) (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1163#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))))))} is UNKNOWN [2018-11-23 10:40:39,280 INFO L273 TraceCheckUtils]: 13: Hoare triple {1171#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1167#(= (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))))) ((_ sign_extend 32) (_ bv0 32)))} is VALID [2018-11-23 10:40:39,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} ~i~0 := 0bv32; {1171#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))))))} is VALID [2018-11-23 10:40:39,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} is VALID [2018-11-23 10:40:39,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} is VALID [2018-11-23 10:40:39,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {1185#(= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))) ((_ sign_extend 32) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1175#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} is VALID [2018-11-23 10:40:41,386 INFO L273 TraceCheckUtils]: 8: Hoare triple {1189#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1185#(= (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))) ((_ sign_extend 32) (_ bv0 32)))} is UNKNOWN [2018-11-23 10:40:41,407 INFO L273 TraceCheckUtils]: 7: Hoare triple {1193#(and (= (_ bv0 32) (bvmul (_ bv2 32) main_~i~0)) (forall ((v_prenex_15 (_ BitVec 32))) (= (bvadd main_~sum~0 (bvmul (_ bv2 64) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_15)))) (bvmul (_ bv2 64) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_15)))))) ((_ sign_extend 32) (_ bv0 32)))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1189#(= ((_ sign_extend 32) (_ bv0 32)) (bvadd (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) main_~sum~0 ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv2 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))))))} is VALID [2018-11-23 10:40:41,412 INFO L273 TraceCheckUtils]: 6: Hoare triple {1063#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1193#(and (= (_ bv0 32) (bvmul (_ bv2 32) main_~i~0)) (forall ((v_prenex_15 (_ BitVec 32))) (= (bvadd main_~sum~0 (bvmul (_ bv2 64) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_15)))) (bvmul (_ bv2 64) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_prenex_15)))))) ((_ sign_extend 32) (_ bv0 32)))))} is VALID [2018-11-23 10:40:41,413 INFO L273 TraceCheckUtils]: 5: Hoare triple {1063#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1063#true} is VALID [2018-11-23 10:40:41,413 INFO L256 TraceCheckUtils]: 4: Hoare triple {1063#true} call #t~ret6 := main(); {1063#true} is VALID [2018-11-23 10:40:41,413 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1063#true} {1063#true} #55#return; {1063#true} is VALID [2018-11-23 10:40:41,413 INFO L273 TraceCheckUtils]: 2: Hoare triple {1063#true} assume true; {1063#true} is VALID [2018-11-23 10:40:41,413 INFO L273 TraceCheckUtils]: 1: Hoare triple {1063#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {1063#true} is VALID [2018-11-23 10:40:41,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {1063#true} call ULTIMATE.init(); {1063#true} is VALID [2018-11-23 10:40:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:41,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 10:40:41,421 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-11-23 10:40:41,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:41,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 10:40:50,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 33 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:50,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 10:40:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 10:40:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2018-11-23 10:40:50,109 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 23 states. [2018-11-23 10:40:52,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:52,898 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 10:40:52,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:40:52,898 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-11-23 10:40:52,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:52,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:40:52,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 10:40:52,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:40:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 34 transitions. [2018-11-23 10:40:52,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 34 transitions. [2018-11-23 10:40:53,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:53,496 INFO L225 Difference]: With dead ends: 36 [2018-11-23 10:40:53,496 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:40:53,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:40:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:40:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:40:53,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:53,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:40:53,514 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:40:53,514 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:40:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:53,516 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 10:40:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 10:40:53,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:53,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:53,517 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:40:53,517 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:40:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:53,519 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 10:40:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 10:40:53,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:53,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:53,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:53,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:40:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 10:40:53,521 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-23 10:40:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:53,522 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 10:40:53,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 10:40:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 10:40:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:40:53,523 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:53,523 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:53,523 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:53,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:53,523 INFO L82 PathProgramCache]: Analyzing trace with hash 2135217443, now seen corresponding path program 3 times [2018-11-23 10:40:53,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:53,524 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:53,553 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:40:53,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:40:53,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:53,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:53,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {1362#true} call ULTIMATE.init(); {1362#true} is VALID [2018-11-23 10:40:53,847 INFO L273 TraceCheckUtils]: 1: Hoare triple {1362#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {1362#true} is VALID [2018-11-23 10:40:53,847 INFO L273 TraceCheckUtils]: 2: Hoare triple {1362#true} assume true; {1362#true} is VALID [2018-11-23 10:40:53,847 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1362#true} {1362#true} #55#return; {1362#true} is VALID [2018-11-23 10:40:53,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {1362#true} call #t~ret6 := main(); {1362#true} is VALID [2018-11-23 10:40:53,848 INFO L273 TraceCheckUtils]: 5: Hoare triple {1362#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1362#true} is VALID [2018-11-23 10:40:53,849 INFO L273 TraceCheckUtils]: 6: Hoare triple {1362#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1385#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:53,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {1385#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1385#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} is VALID [2018-11-23 10:40:53,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {1385#(and (= main_~i~0 (_ bv0 32)) (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1392#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:53,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {1392#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1392#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:53,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {1392#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1399#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:53,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {1399#(and (bvsgt ((_ sign_extend 16) ~SIZE~0) (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:53,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:53,854 INFO L273 TraceCheckUtils]: 13: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:53,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} ~i~0 := 0bv32; {1413#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:53,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {1413#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1413#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:53,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {1413#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= main_~i~0 (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1420#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:53,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {1420#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1420#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:53,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {1420#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1427#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:53,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {1427#(and (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1363#false} is VALID [2018-11-23 10:40:53,861 INFO L256 TraceCheckUtils]: 20: Hoare triple {1363#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {1363#false} is VALID [2018-11-23 10:40:53,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {1363#false} ~cond := #in~cond; {1363#false} is VALID [2018-11-23 10:40:53,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {1363#false} assume 0bv32 == ~cond; {1363#false} is VALID [2018-11-23 10:40:53,862 INFO L273 TraceCheckUtils]: 23: Hoare triple {1363#false} assume !false; {1363#false} is VALID [2018-11-23 10:40:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:53,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:54,259 INFO L273 TraceCheckUtils]: 23: Hoare triple {1363#false} assume !false; {1363#false} is VALID [2018-11-23 10:40:54,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {1363#false} assume 0bv32 == ~cond; {1363#false} is VALID [2018-11-23 10:40:54,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {1363#false} ~cond := #in~cond; {1363#false} is VALID [2018-11-23 10:40:54,260 INFO L256 TraceCheckUtils]: 20: Hoare triple {1363#false} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {1363#false} is VALID [2018-11-23 10:40:54,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {1455#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1363#false} is VALID [2018-11-23 10:40:54,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {1459#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1455#(bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {1459#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1459#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {1466#(bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1459#(bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,281 INFO L273 TraceCheckUtils]: 15: Hoare triple {1466#(bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1466#(bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} ~i~0 := 0bv32; {1466#(bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {1482#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1403#(bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0))} is VALID [2018-11-23 10:40:54,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {1486#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1482#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt main_~i~0 ((_ sign_extend 16) ~SIZE~0))))} is VALID [2018-11-23 10:40:54,286 INFO L273 TraceCheckUtils]: 9: Hoare triple {1486#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1486#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))))} is VALID [2018-11-23 10:40:54,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {1493#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1486#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ((_ sign_extend 16) ~SIZE~0))))} is VALID [2018-11-23 10:40:54,311 INFO L273 TraceCheckUtils]: 7: Hoare triple {1493#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1493#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))))} is VALID [2018-11-23 10:40:54,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {1362#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1493#(or (bvslt (_ bv2 32) ((_ sign_extend 16) ~SIZE~0)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ((_ sign_extend 16) ~SIZE~0))))} is VALID [2018-11-23 10:40:54,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {1362#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1362#true} is VALID [2018-11-23 10:40:54,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {1362#true} call #t~ret6 := main(); {1362#true} is VALID [2018-11-23 10:40:54,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1362#true} {1362#true} #55#return; {1362#true} is VALID [2018-11-23 10:40:54,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {1362#true} assume true; {1362#true} is VALID [2018-11-23 10:40:54,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {1362#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {1362#true} is VALID [2018-11-23 10:40:54,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {1362#true} call ULTIMATE.init(); {1362#true} is VALID [2018-11-23 10:40:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:54,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 10:40:54,321 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 10:40:54,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:54,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 10:40:54,418 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-23 10:40:54,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 10:40:54,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 10:40:54,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:40:54,419 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 15 states. [2018-11-23 10:40:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:55,389 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 10:40:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 10:40:55,389 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 10:40:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:40:55,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 10:40:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 10:40:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2018-11-23 10:40:55,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2018-11-23 10:40:55,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:55,460 INFO L225 Difference]: With dead ends: 34 [2018-11-23 10:40:55,460 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:40:55,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:40:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:40:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 10:40:55,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:55,481 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 10:40:55,481 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 10:40:55,481 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 10:40:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:55,483 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 10:40:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 10:40:55,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:55,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:55,484 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 10:40:55,484 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 10:40:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:55,486 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 10:40:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 10:40:55,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:55,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:55,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:55,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:40:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 10:40:55,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-23 10:40:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:55,488 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 10:40:55,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 10:40:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 10:40:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:40:55,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:55,489 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:55,489 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:55,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash -33253983, now seen corresponding path program 4 times [2018-11-23 10:40:55,490 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:55,490 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:55,512 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:40:55,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:40:55,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:57,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:58,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-11-23 10:40:58,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2018-11-23 10:40:58,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:58,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:58,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:58,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:32 [2018-11-23 10:40:58,456 INFO L256 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1671#true} is VALID [2018-11-23 10:40:58,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {1671#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv16; {1671#true} is VALID [2018-11-23 10:40:58,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2018-11-23 10:40:58,457 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #55#return; {1671#true} is VALID [2018-11-23 10:40:58,457 INFO L256 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret6 := main(); {1671#true} is VALID [2018-11-23 10:40:58,457 INFO L273 TraceCheckUtils]: 5: Hoare triple {1671#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1671#true} is VALID [2018-11-23 10:40:58,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {1671#true} assume ~bvsgt32(~sign_extendFrom16To32(~SIZE~0), 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(2bv32, ~sign_extendFrom16To32(~SIZE~0)));~sum~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 ((_ sign_extend 32) (_ bv0 32))))} is VALID [2018-11-23 10:40:58,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {1694#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 ((_ sign_extend 32) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1698#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:58,459 INFO L273 TraceCheckUtils]: 8: Hoare triple {1698#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1702#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) (_ bv0 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:58,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {1702#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) (_ bv0 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1706#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:58,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {1706#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0)))))) ((_ sign_extend 32) (_ bv0 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1710#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967292 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:58,576 INFO L273 TraceCheckUtils]: 11: Hoare triple {1710#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967292 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32)))))) ((_ sign_extend 32) (_ bv0 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem3 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvadd64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem3)));havoc #t~mem3; {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} is VALID [2018-11-23 10:40:58,577 INFO L273 TraceCheckUtils]: 12: Hoare triple {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} is VALID [2018-11-23 10:40:58,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} is VALID [2018-11-23 10:40:58,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {1714#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} ~i~0 := 0bv32; {1724#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} is VALID [2018-11-23 10:40:59,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {1724#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1728#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} is VALID [2018-11-23 10:40:59,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {1728#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1732#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:59,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {1732#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1736#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:59,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {1736#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0))))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1740#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32))))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:59,311 INFO L273 TraceCheckUtils]: 19: Hoare triple {1740#(and (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|))))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv2 32)))))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv2 32) main_~i~0) (_ bv4294967294 32))))))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0));call #t~mem5 := read~intINTTYPE2(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(2bv32, ~i~0)), 2bv32);~sum~0 := ~bvsub64(~sum~0, ~sign_extendFrom32To64(~sign_extendFrom16To32(#t~mem5)));havoc #t~mem5; {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} is VALID [2018-11-23 10:40:59,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} is VALID [2018-11-23 10:40:59,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} assume !~bvslt32(~i~0, ~sign_extendFrom16To32(~SIZE~0)); {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} is VALID [2018-11-23 10:40:59,314 INFO L256 TraceCheckUtils]: 22: Hoare triple {1744#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12))) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11))) ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_11)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_12)))) (bvneg ((_ sign_extend 32) ((_ sign_extend 16) ((_ extract 15 0) v_arrayElimCell_10)))))))} call __VERIFIER_assert((if ~sum~0 == ~sign_extendFrom32To64(0bv32) then 1bv32 else 0bv32)); {1754#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:59,314 INFO L273 TraceCheckUtils]: 23: Hoare triple {1754#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1758#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:59,314 INFO L273 TraceCheckUtils]: 24: Hoare triple {1758#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1672#false} is VALID [2018-11-23 10:40:59,315 INFO L273 TraceCheckUtils]: 25: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2018-11-23 10:40:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:40:59,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:41:03,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-11-23 10:41:03,719 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,734 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,769 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,771 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:03,908 INFO L303 Elim1Store]: Index analysis took 237 ms [2018-11-23 10:41:04,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 62 treesize of output 213 [2018-11-23 10:41:04,074 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 10:41:14,067 INFO L267 ElimStorePlain]: Start of recursive call 3: 1015 dim-0 vars, End of recursive call: 1015 dim-0 vars, and 512 xjuncts.