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/mapavg5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:36:25,820 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:36:25,823 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:36:25,835 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:36:25,835 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:36:25,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:36:25,837 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:36:25,839 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:36:25,841 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:36:25,842 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:36:25,843 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:36:25,843 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:36:25,844 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:36:25,845 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:36:25,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:36:25,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:36:25,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:36:25,850 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:36:25,852 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:36:25,854 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:36:25,855 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:36:25,856 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:36:25,859 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:36:25,859 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:36:25,859 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:36:25,860 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:36:25,861 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:36:25,862 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:36:25,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:36:25,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:36:25,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:36:25,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:36:25,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:36:25,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:36:25,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:36:25,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:36:25,867 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:36:25,882 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:36:25,882 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:36:25,883 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:36:25,883 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:36:25,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:36:25,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:36:25,884 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:36:25,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:36:25,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:36:25,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:36:25,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:36:25,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:36:25,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:36:25,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:36:25,886 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:36:25,886 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:36:25,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:36:25,887 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:36:25,887 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:36:25,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:36:25,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:36:25,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:36:25,888 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:36:25,888 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:36:25,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:36:25,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:36:25,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:36:25,889 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:36:25,889 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:36:25,889 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:36:25,889 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:36:25,889 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:36:25,890 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:36:25,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:36:25,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:36:25,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:36:25,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:36:25,953 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:36:25,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapavg5_true-unreach-call.i [2018-11-23 10:36:26,016 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf06247e/9dfef720a9f4496cba860009e4721f42/FLAGd40e04402 [2018-11-23 10:36:26,486 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:36:26,488 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapavg5_true-unreach-call.i [2018-11-23 10:36:26,496 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf06247e/9dfef720a9f4496cba860009e4721f42/FLAGd40e04402 [2018-11-23 10:36:26,822 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf06247e/9dfef720a9f4496cba860009e4721f42 [2018-11-23 10:36:26,833 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:36:26,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:36:26,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:36:26,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:36:26,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:36:26,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:26" (1/1) ... [2018-11-23 10:36:26,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@99430e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:26, skipping insertion in model container [2018-11-23 10:36:26,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:36:26" (1/1) ... [2018-11-23 10:36:26,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:36:26,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:36:27,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:36:27,138 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:36:27,175 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:36:27,198 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:36:27,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27 WrapperNode [2018-11-23 10:36:27,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:36:27,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:36:27,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:36:27,200 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:36:27,210 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:36:27" (1/1) ... [2018-11-23 10:36:27,221 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:36:27" (1/1) ... [2018-11-23 10:36:27,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:36:27,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:36:27,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:36:27,232 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:36:27,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (1/1) ... [2018-11-23 10:36:27,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:36:27,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:36:27,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:36:27,308 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:36:27,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (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:36:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:36:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:36:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:36:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:36:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:36:27,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:36:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:36:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:36:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure mapavg [2018-11-23 10:36:27,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mapavg [2018-11-23 10:36:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:36:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:36:28,478 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:36:28,479 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:36:28,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:28 BoogieIcfgContainer [2018-11-23 10:36:28,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:36:28,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:36:28,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:36:28,484 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:36:28,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:36:26" (1/3) ... [2018-11-23 10:36:28,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161072aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:28, skipping insertion in model container [2018-11-23 10:36:28,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:36:27" (2/3) ... [2018-11-23 10:36:28,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161072aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:36:28, skipping insertion in model container [2018-11-23 10:36:28,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:36:28" (3/3) ... [2018-11-23 10:36:28,488 INFO L112 eAbstractionObserver]: Analyzing ICFG mapavg5_true-unreach-call.i [2018-11-23 10:36:28,499 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:36:28,507 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:36:28,526 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:36:28,560 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:36:28,561 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:36:28,561 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:36:28,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:36:28,562 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:36:28,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:36:28,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:36:28,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:36:28,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:36:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:36:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:36:28,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:36:28,596 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:36:28,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:36:28,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:36:28,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1503982502, now seen corresponding path program 1 times [2018-11-23 10:36:28,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:36:28,609 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:36:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:36:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:36:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:36:30,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:36:30,501 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:36:30,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {34#true} is VALID [2018-11-23 10:36:30,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:36:30,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #60#return; {34#true} is VALID [2018-11-23 10:36:30,507 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret11 := main(); {34#true} is VALID [2018-11-23 10:36:30,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2018-11-23 10:36:30,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {57#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:30,517 INFO L256 TraceCheckUtils]: 7: Hoare triple {57#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapavg(~#x~0.base, ~#x~0.offset); {57#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:30,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {64#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:30,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:36:30,519 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:36:30,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:36:30,519 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {35#false} {57#(bvsgt ~N~0 (_ bv1 32))} #64#return; {35#false} is VALID [2018-11-23 10:36:30,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {35#false} is VALID [2018-11-23 10:36:30,520 INFO L256 TraceCheckUtils]: 14: Hoare triple {35#false} call #t~ret6 := mapavg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:36:30,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {35#false} is VALID [2018-11-23 10:36:30,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:36:30,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:36:30,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:36:30,522 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2018-11-23 10:36:30,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {35#false} is VALID [2018-11-23 10:36:30,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {35#false} is VALID [2018-11-23 10:36:30,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {35#false} is VALID [2018-11-23 10:36:30,524 INFO L256 TraceCheckUtils]: 23: Hoare triple {35#false} call #t~ret10 := mapavg(~#x~0.base, ~#x~0.offset); {35#false} is VALID [2018-11-23 10:36:30,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {35#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {35#false} is VALID [2018-11-23 10:36:30,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {35#false} assume !~bvslt32(~i~0, ~N~0); {35#false} is VALID [2018-11-23 10:36:30,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {35#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {35#false} is VALID [2018-11-23 10:36:30,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {35#false} assume true; {35#false} is VALID [2018-11-23 10:36:30,526 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {35#false} {35#false} #68#return; {35#false} is VALID [2018-11-23 10:36:30,526 INFO L273 TraceCheckUtils]: 29: Hoare triple {35#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {35#false} is VALID [2018-11-23 10:36:30,526 INFO L273 TraceCheckUtils]: 30: Hoare triple {35#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {35#false} is VALID [2018-11-23 10:36:30,527 INFO L273 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:36:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:36:30,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:36:30,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:36:30,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:36:30,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:36:30,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:36:30,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:36:30,707 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:30,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:36:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:36:30,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:36:30,720 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 4 states. [2018-11-23 10:36:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:31,865 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-23 10:36:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:36:31,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 10:36:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:36:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:36:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 10:36:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:36:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 10:36:31,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 10:36:32,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:32,299 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:36:32,300 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 10:36:32,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:36:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 10:36:32,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 10:36:32,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:36:32,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-23 10:36:32,373 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-23 10:36:32,373 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-23 10:36:32,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:32,380 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:36:32,380 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:36:32,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:32,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:32,381 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-23 10:36:32,382 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-23 10:36:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:32,386 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-11-23 10:36:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 10:36:32,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:32,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:32,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:36:32,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:36:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:36:32,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2018-11-23 10:36:32,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 32 [2018-11-23 10:36:32,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:36:32,394 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2018-11-23 10:36:32,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:36:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2018-11-23 10:36:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 10:36:32,396 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:36:32,397 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:36:32,397 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:36:32,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:36:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash 793622072, now seen corresponding path program 1 times [2018-11-23 10:36:32,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:36:32,399 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:36:32,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:36:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:36:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:36:33,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:36:34,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 10:36:34,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {301#true} is VALID [2018-11-23 10:36:34,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:36:34,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2018-11-23 10:36:34,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2018-11-23 10:36:34,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {301#true} is VALID [2018-11-23 10:36:34,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:34,089 INFO L256 TraceCheckUtils]: 7: Hoare triple {324#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapavg(~#x~0.base, ~#x~0.offset); {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:34,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {324#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {331#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {331#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {331#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {331#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {338#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,107 INFO L273 TraceCheckUtils]: 11: Hoare triple {338#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:36:34,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:36:34,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:36:34,108 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {302#false} {324#(bvsgt ~N~0 (_ bv1 32))} #64#return; {302#false} is VALID [2018-11-23 10:36:34,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {302#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {302#false} is VALID [2018-11-23 10:36:34,108 INFO L256 TraceCheckUtils]: 16: Hoare triple {302#false} call #t~ret6 := mapavg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 10:36:34,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {302#false} is VALID [2018-11-23 10:36:34,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {302#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {302#false} is VALID [2018-11-23 10:36:34,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {302#false} is VALID [2018-11-23 10:36:34,110 INFO L273 TraceCheckUtils]: 20: Hoare triple {302#false} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:36:34,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:36:34,110 INFO L273 TraceCheckUtils]: 22: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:36:34,111 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {302#false} {302#false} #66#return; {302#false} is VALID [2018-11-23 10:36:34,111 INFO L273 TraceCheckUtils]: 24: Hoare triple {302#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {302#false} is VALID [2018-11-23 10:36:34,111 INFO L273 TraceCheckUtils]: 25: Hoare triple {302#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {302#false} is VALID [2018-11-23 10:36:34,111 INFO L273 TraceCheckUtils]: 26: Hoare triple {302#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {302#false} is VALID [2018-11-23 10:36:34,112 INFO L256 TraceCheckUtils]: 27: Hoare triple {302#false} call #t~ret10 := mapavg(~#x~0.base, ~#x~0.offset); {302#false} is VALID [2018-11-23 10:36:34,112 INFO L273 TraceCheckUtils]: 28: Hoare triple {302#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {302#false} is VALID [2018-11-23 10:36:34,112 INFO L273 TraceCheckUtils]: 29: Hoare triple {302#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {302#false} is VALID [2018-11-23 10:36:34,112 INFO L273 TraceCheckUtils]: 30: Hoare triple {302#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {302#false} is VALID [2018-11-23 10:36:34,115 INFO L273 TraceCheckUtils]: 31: Hoare triple {302#false} assume !~bvslt32(~i~0, ~N~0); {302#false} is VALID [2018-11-23 10:36:34,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {302#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {302#false} is VALID [2018-11-23 10:36:34,115 INFO L273 TraceCheckUtils]: 33: Hoare triple {302#false} assume true; {302#false} is VALID [2018-11-23 10:36:34,115 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {302#false} {302#false} #68#return; {302#false} is VALID [2018-11-23 10:36:34,119 INFO L273 TraceCheckUtils]: 35: Hoare triple {302#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {302#false} is VALID [2018-11-23 10:36:34,119 INFO L273 TraceCheckUtils]: 36: Hoare triple {302#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {302#false} is VALID [2018-11-23 10:36:34,119 INFO L273 TraceCheckUtils]: 37: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 10:36:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 10:36:34,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:36:34,580 INFO L273 TraceCheckUtils]: 37: Hoare triple {302#false} assume !false; {302#false} is VALID [2018-11-23 10:36:34,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {302#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {302#false} is VALID [2018-11-23 10:36:34,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {302#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {302#false} is VALID [2018-11-23 10:36:34,581 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {301#true} {302#false} #68#return; {302#false} is VALID [2018-11-23 10:36:34,581 INFO L273 TraceCheckUtils]: 33: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:36:34,582 INFO L273 TraceCheckUtils]: 32: Hoare triple {301#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {301#true} is VALID [2018-11-23 10:36:34,582 INFO L273 TraceCheckUtils]: 31: Hoare triple {301#true} assume !~bvslt32(~i~0, ~N~0); {301#true} is VALID [2018-11-23 10:36:34,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {301#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {301#true} is VALID [2018-11-23 10:36:34,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {301#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {301#true} is VALID [2018-11-23 10:36:34,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {301#true} is VALID [2018-11-23 10:36:34,584 INFO L256 TraceCheckUtils]: 27: Hoare triple {302#false} call #t~ret10 := mapavg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:36:34,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {302#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {302#false} is VALID [2018-11-23 10:36:34,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {302#false} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {302#false} is VALID [2018-11-23 10:36:34,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {302#false} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {302#false} is VALID [2018-11-23 10:36:34,586 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {301#true} {302#false} #66#return; {302#false} is VALID [2018-11-23 10:36:34,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:36:34,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {301#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {301#true} is VALID [2018-11-23 10:36:34,587 INFO L273 TraceCheckUtils]: 20: Hoare triple {301#true} assume !~bvslt32(~i~0, ~N~0); {301#true} is VALID [2018-11-23 10:36:34,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {301#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {301#true} is VALID [2018-11-23 10:36:34,587 INFO L273 TraceCheckUtils]: 18: Hoare triple {301#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {301#true} is VALID [2018-11-23 10:36:34,587 INFO L273 TraceCheckUtils]: 17: Hoare triple {301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {301#true} is VALID [2018-11-23 10:36:34,588 INFO L256 TraceCheckUtils]: 16: Hoare triple {302#false} call #t~ret6 := mapavg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:36:34,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {302#false} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {302#false} is VALID [2018-11-23 10:36:34,589 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {492#(not (bvsgt ~N~0 (_ bv1 32)))} {324#(bvsgt ~N~0 (_ bv1 32))} #64#return; {302#false} is VALID [2018-11-23 10:36:34,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {492#(not (bvsgt ~N~0 (_ bv1 32)))} assume true; {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {492#(not (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {502#(or (bvslt mapavg_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !~bvslt32(~i~0, ~N~0); {492#(not (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:34,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {506#(or (bvslt (bvadd mapavg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {502#(or (bvslt mapavg_~i~0 ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:36:34,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {506#(or (bvslt (bvadd mapavg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {506#(or (bvslt (bvadd mapavg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:36:34,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {301#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {506#(or (bvslt (bvadd mapavg_~i~0 (_ bv1 32)) ~N~0) (not (bvsgt ~N~0 (_ bv1 32))))} is VALID [2018-11-23 10:36:34,620 INFO L256 TraceCheckUtils]: 7: Hoare triple {324#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapavg(~#x~0.base, ~#x~0.offset); {301#true} is VALID [2018-11-23 10:36:34,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {324#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:34,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {301#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {301#true} is VALID [2018-11-23 10:36:34,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret11 := main(); {301#true} is VALID [2018-11-23 10:36:34,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2018-11-23 10:36:34,621 INFO L273 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2018-11-23 10:36:34,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {301#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {301#true} is VALID [2018-11-23 10:36:34,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {301#true} is VALID [2018-11-23 10:36:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 10:36:34,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:36:34,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 10:36:34,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:36:34,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:36:34,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:36:35,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:35,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:36:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:36:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:36:35,018 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 8 states. [2018-11-23 10:36:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:36,226 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 10:36:36,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:36:36,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-23 10:36:36,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:36:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:36:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:36:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:36:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 10:36:36,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2018-11-23 10:36:36,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:36,499 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:36:36,499 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:36:36,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 10:36:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:36:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 10:36:36,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:36:36,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 10:36:36,520 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 10:36:36,521 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 10:36:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:36,524 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:36:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:36:36,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:36,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:36,525 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 10:36:36,526 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 10:36:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:36,529 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 10:36:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 10:36:36,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:36,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:36,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:36:36,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:36:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:36:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 10:36:36,533 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 38 [2018-11-23 10:36:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:36:36,534 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 10:36:36,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:36:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 10:36:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:36:36,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:36:36,536 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:36:36,536 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:36:36,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:36:36,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1803239830, now seen corresponding path program 2 times [2018-11-23 10:36:36,537 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:36:36,537 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:36:36,559 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:36:38,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:36:38,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:36:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:36:38,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:36:39,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 10:36:39,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {701#true} is VALID [2018-11-23 10:36:39,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:36:39,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #60#return; {701#true} is VALID [2018-11-23 10:36:39,032 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret11 := main(); {701#true} is VALID [2018-11-23 10:36:39,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {701#true} is VALID [2018-11-23 10:36:39,033 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {724#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:39,034 INFO L256 TraceCheckUtils]: 7: Hoare triple {724#(bvsgt ~N~0 (_ bv1 32))} call #t~ret3 := mapavg(~#x~0.base, ~#x~0.offset); {724#(bvsgt ~N~0 (_ bv1 32))} is VALID [2018-11-23 10:36:39,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {724#(bvsgt ~N~0 (_ bv1 32))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {731#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,036 INFO L273 TraceCheckUtils]: 9: Hoare triple {731#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {731#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {731#(and (= (_ bv0 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {738#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {738#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {738#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,060 INFO L273 TraceCheckUtils]: 12: Hoare triple {738#(and (= (_ bv1 32) mapavg_~i~0) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {745#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) mapavg_~i~0))} is VALID [2018-11-23 10:36:39,074 INFO L273 TraceCheckUtils]: 13: Hoare triple {745#(and (bvsgt ~N~0 (_ bv1 32)) (= (_ bv2 32) mapavg_~i~0))} assume !~bvslt32(~i~0, ~N~0); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,085 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {724#(bvsgt ~N~0 (_ bv1 32))} #64#return; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,086 INFO L273 TraceCheckUtils]: 17: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,087 INFO L256 TraceCheckUtils]: 18: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} call #t~ret6 := mapavg(~#x~0.base, ~#x~0.offset); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,091 INFO L273 TraceCheckUtils]: 21: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,093 INFO L273 TraceCheckUtils]: 24: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~N~0); {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,094 INFO L273 TraceCheckUtils]: 25: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} assume true; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,097 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} #66#return; {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} is VALID [2018-11-23 10:36:39,098 INFO L273 TraceCheckUtils]: 28: Hoare triple {749#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} is VALID [2018-11-23 10:36:39,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#(and (not (bvslt (_ bv2 32) ~N~0)) (bvsgt ~N~0 (_ bv1 32)) (= main_~i~1 (_ bv0 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {702#false} is VALID [2018-11-23 10:36:39,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {702#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {702#false} is VALID [2018-11-23 10:36:39,101 INFO L256 TraceCheckUtils]: 31: Hoare triple {702#false} call #t~ret10 := mapavg(~#x~0.base, ~#x~0.offset); {702#false} is VALID [2018-11-23 10:36:39,101 INFO L273 TraceCheckUtils]: 32: Hoare triple {702#false} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {702#false} is VALID [2018-11-23 10:36:39,102 INFO L273 TraceCheckUtils]: 33: Hoare triple {702#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {702#false} is VALID [2018-11-23 10:36:39,102 INFO L273 TraceCheckUtils]: 34: Hoare triple {702#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {702#false} is VALID [2018-11-23 10:36:39,103 INFO L273 TraceCheckUtils]: 35: Hoare triple {702#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {702#false} is VALID [2018-11-23 10:36:39,103 INFO L273 TraceCheckUtils]: 36: Hoare triple {702#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {702#false} is VALID [2018-11-23 10:36:39,103 INFO L273 TraceCheckUtils]: 37: Hoare triple {702#false} assume !~bvslt32(~i~0, ~N~0); {702#false} is VALID [2018-11-23 10:36:39,103 INFO L273 TraceCheckUtils]: 38: Hoare triple {702#false} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {702#false} is VALID [2018-11-23 10:36:39,103 INFO L273 TraceCheckUtils]: 39: Hoare triple {702#false} assume true; {702#false} is VALID [2018-11-23 10:36:39,104 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {702#false} {702#false} #68#return; {702#false} is VALID [2018-11-23 10:36:39,104 INFO L273 TraceCheckUtils]: 41: Hoare triple {702#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {702#false} is VALID [2018-11-23 10:36:39,104 INFO L273 TraceCheckUtils]: 42: Hoare triple {702#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {702#false} is VALID [2018-11-23 10:36:39,104 INFO L273 TraceCheckUtils]: 43: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 10:36:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 35 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:36:39,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:36:39,514 INFO L273 TraceCheckUtils]: 43: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 10:36:39,514 INFO L273 TraceCheckUtils]: 42: Hoare triple {702#false} assume ~ret~1 != ~ret2~0 || ~ret~1 != ~ret5~0; {702#false} is VALID [2018-11-23 10:36:39,515 INFO L273 TraceCheckUtils]: 41: Hoare triple {702#false} ~ret5~0 := #t~ret10;havoc #t~ret10; {702#false} is VALID [2018-11-23 10:36:39,515 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {701#true} {702#false} #68#return; {702#false} is VALID [2018-11-23 10:36:39,515 INFO L273 TraceCheckUtils]: 39: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:36:39,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:36:39,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:36:39,516 INFO L273 TraceCheckUtils]: 36: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,516 INFO L273 TraceCheckUtils]: 35: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,517 INFO L273 TraceCheckUtils]: 34: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,517 INFO L273 TraceCheckUtils]: 33: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,517 INFO L273 TraceCheckUtils]: 32: Hoare triple {701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {701#true} is VALID [2018-11-23 10:36:39,518 INFO L256 TraceCheckUtils]: 31: Hoare triple {702#false} call #t~ret10 := mapavg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:36:39,518 INFO L273 TraceCheckUtils]: 30: Hoare triple {702#false} call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(~#x~0.offset, ~bvmul32(4bv32, ~bvsub32(~N~0, 1bv32))), 4bv32); {702#false} is VALID [2018-11-23 10:36:39,518 INFO L273 TraceCheckUtils]: 29: Hoare triple {883#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} assume !~bvslt32(~i~1, ~bvsub32(~N~0, 1bv32)); {702#false} is VALID [2018-11-23 10:36:39,523 INFO L273 TraceCheckUtils]: 28: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret2~0 := #t~ret6;havoc #t~ret6;call #t~mem7 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem7;havoc #t~mem7;~i~1 := 0bv32; {883#(bvslt main_~i~1 (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:36:39,524 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {701#true} {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #66#return; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:36:39,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:36:39,524 INFO L273 TraceCheckUtils]: 25: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:36:39,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:36:39,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,526 INFO L273 TraceCheckUtils]: 19: Hoare triple {701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {701#true} is VALID [2018-11-23 10:36:39,526 INFO L256 TraceCheckUtils]: 18: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret6 := mapavg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:36:39,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} ~ret~1 := #t~ret3;havoc #t~ret3;call #t~mem4 := read~intINTTYPE4(~#x~0.base, ~#x~0.offset, 4bv32);~temp~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32);call write~intINTTYPE4(#t~mem5, ~#x~0.base, ~#x~0.offset, 4bv32);havoc #t~mem5;call write~intINTTYPE4(~temp~0, ~#x~0.base, ~bvadd32(4bv32, ~#x~0.offset), 4bv32); {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:36:39,528 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {701#true} {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} #64#return; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:36:39,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:36:39,528 INFO L273 TraceCheckUtils]: 14: Hoare triple {701#true} #res := ~bvsdiv64(~ret~0, ~sign_extendFrom32To64(~N~0))[32:0]; {701#true} is VALID [2018-11-23 10:36:39,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {701#true} assume !~bvslt32(~i~0, ~N~0); {701#true} is VALID [2018-11-23 10:36:39,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,529 INFO L273 TraceCheckUtils]: 11: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {701#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {701#true} is VALID [2018-11-23 10:36:39,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {701#true} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~x.base, ~bvadd32(~x.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~ret~0 := ~bvadd64(~bvadd64(~ret~0, ~sign_extendFrom32To64(~i~0)), ~sign_extendFrom32To64(#t~mem1));havoc #t~mem1; {701#true} is VALID [2018-11-23 10:36:39,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {701#true} ~x.base, ~x.offset := #in~x.base, #in~x.offset;havoc ~i~0;havoc ~ret~0;~ret~0 := ~sign_extendFrom32To64(0bv32);~i~0 := 0bv32; {701#true} is VALID [2018-11-23 10:36:39,530 INFO L256 TraceCheckUtils]: 7: Hoare triple {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} call #t~ret3 := mapavg(~#x~0.base, ~#x~0.offset); {701#true} is VALID [2018-11-23 10:36:39,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {701#true} assume ~bvsgt32(~N~0, 1bv32);call ~#x~0.base, ~#x~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));havoc ~temp~0;havoc ~ret~1;havoc ~ret2~0;havoc ~ret5~0; {887#(bvslt (_ bv0 32) (bvadd ~N~0 (_ bv4294967295 32)))} is VALID [2018-11-23 10:36:39,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} ~N~0 := #t~nondet2;havoc #t~nondet2; {701#true} is VALID [2018-11-23 10:36:39,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret11 := main(); {701#true} is VALID [2018-11-23 10:36:39,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #60#return; {701#true} is VALID [2018-11-23 10:36:39,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:36:39,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {701#true} is VALID [2018-11-23 10:36:39,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 10:36:39,538 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 10:36:39,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 10:36:39,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-23 10:36:39,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:36:39,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:36:39,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 10:36:39,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:39,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 10:36:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 10:36:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:36:39,870 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2018-11-23 10:36:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:42,143 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2018-11-23 10:36:42,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:36:42,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 10:36:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:36:42,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:36:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:36:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 10:36:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 83 transitions. [2018-11-23 10:36:42,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 83 transitions. [2018-11-23 10:36:42,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:36:42,535 INFO L225 Difference]: With dead ends: 72 [2018-11-23 10:36:42,536 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:36:42,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 10:36:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:36:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-11-23 10:36:42,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:36:42,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 48 states. [2018-11-23 10:36:42,575 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 48 states. [2018-11-23 10:36:42,575 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 48 states. [2018-11-23 10:36:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:42,580 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:36:42,580 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:36:42,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:42,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:42,582 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 54 states. [2018-11-23 10:36:42,582 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 54 states. [2018-11-23 10:36:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:36:42,587 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-11-23 10:36:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:36:42,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:36:42,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:36:42,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:36:42,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:36:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:36:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 10:36:42,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 44 [2018-11-23 10:36:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:36:42,593 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 10:36:42,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 10:36:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 10:36:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 10:36:42,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:36:42,596 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:36:42,596 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:36:42,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:36:42,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1725825260, now seen corresponding path program 1 times [2018-11-23 10:36:42,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:36:42,597 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:36:42,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY