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/ldv-regression/test23_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:48,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:48,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:48,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:48,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:48,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:48,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:48,875 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:48,877 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:48,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:48,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:48,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:48,880 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:48,881 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:48,882 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:48,883 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:48,884 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:48,885 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:48,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:48,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:48,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:48,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:48,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:48,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:48,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:48,897 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:48,898 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:48,899 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:48,900 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:48,903 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:48,903 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:48,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:48,906 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:48,906 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:48,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:48,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:48,910 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 11:07:48,943 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:48,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:48,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:48,947 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:48,948 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:48,948 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:48,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:48,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:48,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:48,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:48,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:48,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:48,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:48,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:48,951 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:48,951 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:48,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:48,952 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:48,952 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:48,952 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:48,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:48,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:48,953 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:48,953 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:48,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:48,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:48,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:48,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:48,955 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:48,955 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:48,955 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:48,956 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:48,956 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:49,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:49,017 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:49,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:49,023 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:49,023 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:49,024 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test23_true-unreach-call.c [2018-11-23 11:07:49,092 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e26177e/7005f609ebc04f3db7070e58c573b56b/FLAGed93c6c9d [2018-11-23 11:07:49,573 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:49,574 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test23_true-unreach-call.c [2018-11-23 11:07:49,580 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e26177e/7005f609ebc04f3db7070e58c573b56b/FLAGed93c6c9d [2018-11-23 11:07:49,902 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e26177e/7005f609ebc04f3db7070e58c573b56b [2018-11-23 11:07:49,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:49,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:49,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:49,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:49,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:49,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:49" (1/1) ... [2018-11-23 11:07:49,923 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274eb217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:49, skipping insertion in model container [2018-11-23 11:07:49,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:49" (1/1) ... [2018-11-23 11:07:49,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:49,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:50,234 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:50,264 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:50,294 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:50,330 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:50,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50 WrapperNode [2018-11-23 11:07:50,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:50,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:50,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:50,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:50,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,361 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:50,361 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:50,361 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:50,361 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:50,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,398 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (1/1) ... [2018-11-23 11:07:50,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:50,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:50,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:50,484 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:50,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (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 11:07:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-23 11:07:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-23 11:07:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:07:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 11:07:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 11:07:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:50,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2018-11-23 11:07:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2018-11-23 11:07:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:51,377 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:51,378 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:07:51,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:51 BoogieIcfgContainer [2018-11-23 11:07:51,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:51,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:51,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:51,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:51,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:49" (1/3) ... [2018-11-23 11:07:51,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635d2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:51, skipping insertion in model container [2018-11-23 11:07:51,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:50" (2/3) ... [2018-11-23 11:07:51,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@635d2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:51, skipping insertion in model container [2018-11-23 11:07:51,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:51" (3/3) ... [2018-11-23 11:07:51,387 INFO L112 eAbstractionObserver]: Analyzing ICFG test23_true-unreach-call.c [2018-11-23 11:07:51,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:51,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:51,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:51,455 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:51,456 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:51,456 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:51,456 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:51,457 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:51,457 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:51,457 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:51,457 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:51,458 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 11:07:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 11:07:51,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:51,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:51,487 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:51,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:51,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1990909713, now seen corresponding path program 1 times [2018-11-23 11:07:51,500 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:51,501 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 11:07:51,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:51,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:51,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 11:07:51,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {35#true} is VALID [2018-11-23 11:07:51,977 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 11:07:51,977 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #52#return; {35#true} is VALID [2018-11-23 11:07:51,977 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret14 := main(); {35#true} is VALID [2018-11-23 11:07:51,978 INFO L256 TraceCheckUtils]: 5: Hoare triple {35#true} call init(); {35#true} is VALID [2018-11-23 11:07:51,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {35#true} is VALID [2018-11-23 11:07:51,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 11:07:51,979 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {35#true} {35#true} #56#return; {35#true} is VALID [2018-11-23 11:07:51,979 INFO L256 TraceCheckUtils]: 9: Hoare triple {35#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {35#true} is VALID [2018-11-23 11:07:51,979 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {35#true} is VALID [2018-11-23 11:07:51,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {35#true} is VALID [2018-11-23 11:07:51,980 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 11:07:51,981 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {35#true} {35#true} #58#return; {35#true} is VALID [2018-11-23 11:07:51,981 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {35#true} is VALID [2018-11-23 11:07:51,981 INFO L256 TraceCheckUtils]: 15: Hoare triple {35#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {35#true} is VALID [2018-11-23 11:07:51,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {35#true} is VALID [2018-11-23 11:07:51,982 INFO L273 TraceCheckUtils]: 17: Hoare triple {35#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {35#true} is VALID [2018-11-23 11:07:51,982 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 11:07:51,983 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {35#true} {35#true} #60#return; {35#true} is VALID [2018-11-23 11:07:51,983 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {35#true} is VALID [2018-11-23 11:07:51,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {35#true} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {35#true} is VALID [2018-11-23 11:07:51,996 INFO L273 TraceCheckUtils]: 22: Hoare triple {35#true} assume !true; {36#false} is VALID [2018-11-23 11:07:51,997 INFO L256 TraceCheckUtils]: 23: Hoare triple {36#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {36#false} is VALID [2018-11-23 11:07:51,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {36#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {36#false} is VALID [2018-11-23 11:07:51,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2018-11-23 11:07:51,998 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #62#return; {36#false} is VALID [2018-11-23 11:07:51,998 INFO L273 TraceCheckUtils]: 27: Hoare triple {36#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {36#false} is VALID [2018-11-23 11:07:51,999 INFO L273 TraceCheckUtils]: 28: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 11:07:52,004 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 11:07:52,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:52,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:52,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:07:52,023 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:07:52,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:52,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:07:52,187 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 11:07:52,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:07:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:07:52,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:07:52,198 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 11:07:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:52,411 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 11:07:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:07:52,411 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 11:07:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:52,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:07:52,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:07:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 11:07:52,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 11:07:52,682 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 11:07:52,703 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:07:52,703 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:07:52,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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 11:07:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:07:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 11:07:52,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:52,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 11:07:52,782 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:07:52,782 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:07:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:52,788 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:07:52,789 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:07:52,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:52,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:52,790 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 11:07:52,790 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 11:07:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:52,796 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 11:07:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:07:52,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:52,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:52,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:52,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:07:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 11:07:52,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 29 [2018-11-23 11:07:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:52,804 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 11:07:52,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:07:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 11:07:52,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:07:52,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:52,806 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:52,807 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:52,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:52,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1991018276, now seen corresponding path program 1 times [2018-11-23 11:07:52,808 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:52,809 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 11:07:52,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:53,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:53,500 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-23 11:07:53,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:07:53,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:07:53,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:53,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:53,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-23 11:07:53,970 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:53,970 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, v_main_~i~0_10]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)))) (and (= .cse0 main_~pa~0.offset) (= (store |v_#memory_int_15| main_~pa~0.base (store (select |v_#memory_int_15| main_~pa~0.base) .cse0 v_main_~i~0_10)) |#memory_int|) (bvslt v_main_~i~0_10 (_ bv10 32)) (bvsge v_main_~i~0_10 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) .cse0)))) [2018-11-23 11:07:53,971 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_10]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)))) (let ((.cse1 (select (select |#memory_int| main_~pa~0.base) .cse0))) (and (= .cse0 main_~pa~0.offset) (bvslt v_main_~i~0_10 (_ bv10 32)) (= v_main_~i~0_10 .cse1) (bvsge v_main_~i~0_10 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) .cse1)))) [2018-11-23 11:07:54,281 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 36 treesize of output 30 [2018-11-23 11:07:54,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-23 11:07:54,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:54,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-23 11:07:54,396 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:54,396 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_10]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32))))) (and (= |main_#t~mem11| .cse0) (bvslt v_main_~i~0_10 (_ bv10 32)) (= v_main_~i~0_10 .cse0) (bvsge v_main_~i~0_10 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) .cse0))) [2018-11-23 11:07:54,396 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem11| (_ bv0 32)) (= |main_#t~mem11| (bvadd main_~i~0 (_ bv10 32))) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:07:54,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {275#true} call ULTIMATE.init(); {275#true} is VALID [2018-11-23 11:07:54,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {275#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,493 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {283#(= (_ bv0 32) |~#d1~0.offset|)} {275#true} #52#return; {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret14 := main(); {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,495 INFO L256 TraceCheckUtils]: 5: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,497 INFO L273 TraceCheckUtils]: 6: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,498 INFO L273 TraceCheckUtils]: 7: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,503 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {283#(= (_ bv0 32) |~#d1~0.offset|)} {283#(= (_ bv0 32) |~#d1~0.offset|)} #56#return; {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,504 INFO L256 TraceCheckUtils]: 9: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,505 INFO L273 TraceCheckUtils]: 10: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {311#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {311#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,509 INFO L273 TraceCheckUtils]: 12: Hoare triple {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,511 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {283#(= (_ bv0 32) |~#d1~0.offset|)} #58#return; {322#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,511 INFO L273 TraceCheckUtils]: 14: Hoare triple {322#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {326#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,531 INFO L256 TraceCheckUtils]: 15: Hoare triple {326#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {283#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:07:54,539 INFO L273 TraceCheckUtils]: 16: Hoare triple {283#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {311#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {311#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:07:54,547 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {315#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {326#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} #60#return; {342#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= (_ bv0 32) |main_#t~ret8.offset|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} is VALID [2018-11-23 11:07:54,554 INFO L273 TraceCheckUtils]: 20: Hoare triple {342#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= (_ bv0 32) |main_#t~ret8.offset|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {346#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:07:54,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {346#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {350#(exists ((v_main_~i~0_10 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_10 (_ bv10 32)) (= v_main_~i~0_10 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)))) (bvsge v_main_~i~0_10 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32))))))} is VALID [2018-11-23 11:07:54,583 INFO L273 TraceCheckUtils]: 22: Hoare triple {350#(exists ((v_main_~i~0_10 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_10 (_ bv10 32)) (= v_main_~i~0_10 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32)))) (bvsge v_main_~i~0_10 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_10) (_ bv8 32))))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {354#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd |main_#t~mem11| (_ bv4294967286 32)) main_~i~0) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:07:54,584 INFO L273 TraceCheckUtils]: 23: Hoare triple {354#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd |main_#t~mem11| (_ bv4294967286 32)) main_~i~0) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {276#false} is VALID [2018-11-23 11:07:54,585 INFO L256 TraceCheckUtils]: 24: Hoare triple {276#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {276#false} is VALID [2018-11-23 11:07:54,585 INFO L273 TraceCheckUtils]: 25: Hoare triple {276#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {276#false} is VALID [2018-11-23 11:07:54,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {276#false} assume true; {276#false} is VALID [2018-11-23 11:07:54,586 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {276#false} {276#false} #62#return; {276#false} is VALID [2018-11-23 11:07:54,586 INFO L273 TraceCheckUtils]: 28: Hoare triple {276#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {276#false} is VALID [2018-11-23 11:07:54,586 INFO L273 TraceCheckUtils]: 29: Hoare triple {276#false} assume !false; {276#false} is VALID [2018-11-23 11:07:54,590 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 11:07:54,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:54,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:54,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:07:54,597 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:07:54,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:54,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:07:54,712 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 11:07:54,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:07:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:07:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:07:54,713 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 11 states. [2018-11-23 11:07:56,097 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 11:07:56,413 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-11-23 11:07:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,087 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-11-23 11:07:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:07:57,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-11-23 11:07:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:07:57,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:07:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2018-11-23 11:07:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:07:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2018-11-23 11:07:57,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 57 transitions. [2018-11-23 11:07:57,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:57,250 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:07:57,250 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:07:57,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:07:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:07:57,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-11-23 11:07:57,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:07:57,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2018-11-23 11:07:57,309 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2018-11-23 11:07:57,309 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2018-11-23 11:07:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,315 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:07:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 11:07:57,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:57,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:57,317 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2018-11-23 11:07:57,317 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2018-11-23 11:07:57,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:07:57,322 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 11:07:57,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 11:07:57,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:07:57,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:07:57,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:07:57,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:07:57,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:07:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-11-23 11:07:57,328 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 30 [2018-11-23 11:07:57,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:07:57,328 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-11-23 11:07:57,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:07:57,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-11-23 11:07:57,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:07:57,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:57,330 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:57,331 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:57,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:57,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1173369826, now seen corresponding path program 1 times [2018-11-23 11:07:57,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:57,332 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 11:07:57,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:57,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:57,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-23 11:07:57,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 11:07:57,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:57,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 11:07:57,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 11:07:57,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} {592#true} #52#return; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,898 INFO L256 TraceCheckUtils]: 4: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret14 := main(); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,899 INFO L256 TraceCheckUtils]: 5: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,900 INFO L273 TraceCheckUtils]: 7: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,901 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} {600#(not (= |~#d1~0.base| |~#d2~0.base|))} #56#return; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,901 INFO L256 TraceCheckUtils]: 9: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret7.base, #t~ret7.offset := get_dummy(); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:57,902 INFO L273 TraceCheckUtils]: 10: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {628#(and (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:57,903 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(and (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {632#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:57,904 INFO L273 TraceCheckUtils]: 12: Hoare triple {632#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} assume true; {632#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:07:57,906 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {632#(and (= |get_dummy_#res.base| |~#d2~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} {600#(not (= |~#d1~0.base| |~#d2~0.base|))} #58#return; {639#(not (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2018-11-23 11:07:57,907 INFO L273 TraceCheckUtils]: 14: Hoare triple {639#(not (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {643#(not (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 11:07:57,907 INFO L256 TraceCheckUtils]: 15: Hoare triple {643#(not (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {592#true} is VALID [2018-11-23 11:07:57,908 INFO L273 TraceCheckUtils]: 16: Hoare triple {592#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {650#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} is VALID [2018-11-23 11:07:57,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {650#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {654#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:57,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {654#(= |get_dummy_#res.base| |~#d1~0.base|)} assume true; {654#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:57,910 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {654#(= |get_dummy_#res.base| |~#d1~0.base|)} {643#(not (= |~#d1~0.base| main_~pd1~0.base))} #60#return; {661#(not (= main_~pd1~0.base |main_#t~ret8.base|))} is VALID [2018-11-23 11:07:57,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {661#(not (= main_~pd1~0.base |main_#t~ret8.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {665#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:07:57,913 INFO L273 TraceCheckUtils]: 21: Hoare triple {665#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {593#false} is VALID [2018-11-23 11:07:57,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {593#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {593#false} is VALID [2018-11-23 11:07:57,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {593#false} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {593#false} is VALID [2018-11-23 11:07:57,914 INFO L256 TraceCheckUtils]: 24: Hoare triple {593#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {593#false} is VALID [2018-11-23 11:07:57,914 INFO L273 TraceCheckUtils]: 25: Hoare triple {593#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {593#false} is VALID [2018-11-23 11:07:57,915 INFO L273 TraceCheckUtils]: 26: Hoare triple {593#false} assume true; {593#false} is VALID [2018-11-23 11:07:57,915 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {593#false} {593#false} #62#return; {593#false} is VALID [2018-11-23 11:07:57,916 INFO L273 TraceCheckUtils]: 28: Hoare triple {593#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {593#false} is VALID [2018-11-23 11:07:57,916 INFO L273 TraceCheckUtils]: 29: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 11:07:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:57,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:07:58,218 INFO L273 TraceCheckUtils]: 29: Hoare triple {593#false} assume !false; {593#false} is VALID [2018-11-23 11:07:58,218 INFO L273 TraceCheckUtils]: 28: Hoare triple {593#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {593#false} is VALID [2018-11-23 11:07:58,219 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {592#true} {593#false} #62#return; {593#false} is VALID [2018-11-23 11:07:58,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 11:07:58,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {592#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {592#true} is VALID [2018-11-23 11:07:58,220 INFO L256 TraceCheckUtils]: 24: Hoare triple {593#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {592#true} is VALID [2018-11-23 11:07:58,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {593#false} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {593#false} is VALID [2018-11-23 11:07:58,220 INFO L273 TraceCheckUtils]: 22: Hoare triple {593#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {593#false} is VALID [2018-11-23 11:07:58,233 INFO L273 TraceCheckUtils]: 21: Hoare triple {665#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {593#false} is VALID [2018-11-23 11:07:58,234 INFO L273 TraceCheckUtils]: 20: Hoare triple {661#(not (= main_~pd1~0.base |main_#t~ret8.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {665#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:07:58,238 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {654#(= |get_dummy_#res.base| |~#d1~0.base|)} {643#(not (= |~#d1~0.base| main_~pd1~0.base))} #60#return; {661#(not (= main_~pd1~0.base |main_#t~ret8.base|))} is VALID [2018-11-23 11:07:58,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {654#(= |get_dummy_#res.base| |~#d1~0.base|)} assume true; {654#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:58,239 INFO L273 TraceCheckUtils]: 17: Hoare triple {650#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {654#(= |get_dummy_#res.base| |~#d1~0.base|)} is VALID [2018-11-23 11:07:58,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {592#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {650#(= |~#d1~0.base| |get_dummy_#t~ite5.base|)} is VALID [2018-11-23 11:07:58,240 INFO L256 TraceCheckUtils]: 15: Hoare triple {643#(not (= |~#d1~0.base| main_~pd1~0.base))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {592#true} is VALID [2018-11-23 11:07:58,245 INFO L273 TraceCheckUtils]: 14: Hoare triple {639#(not (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {643#(not (= |~#d1~0.base| main_~pd1~0.base))} is VALID [2018-11-23 11:07:58,246 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {744#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} {600#(not (= |~#d1~0.base| |~#d2~0.base|))} #58#return; {639#(not (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2018-11-23 11:07:58,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {744#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} assume true; {744#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {751#(or (not (= |~#d1~0.base| |get_dummy_#t~ite5.base|)) (= |~#d1~0.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {744#(or (not (= |get_dummy_#res.base| |~#d1~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {592#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {751#(or (not (= |~#d1~0.base| |get_dummy_#t~ite5.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,250 INFO L256 TraceCheckUtils]: 9: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret7.base, #t~ret7.offset := get_dummy(); {592#true} is VALID [2018-11-23 11:07:58,251 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {592#true} {600#(not (= |~#d1~0.base| |~#d2~0.base|))} #56#return; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {592#true} assume true; {592#true} is VALID [2018-11-23 11:07:58,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {592#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {592#true} is VALID [2018-11-23 11:07:58,252 INFO L256 TraceCheckUtils]: 5: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {592#true} is VALID [2018-11-23 11:07:58,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret14 := main(); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} {592#true} #52#return; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {600#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {592#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {600#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:07:58,261 INFO L256 TraceCheckUtils]: 0: Hoare triple {592#true} call ULTIMATE.init(); {592#true} is VALID [2018-11-23 11:07:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:07:58,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:07:58,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 11:07:58,266 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 11:07:58,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:58,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:07:58,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:58,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:07:58,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:07:58,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:07:58,346 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 13 states. [2018-11-23 11:08:00,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,396 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 11:08:00,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:08:00,397 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-11-23 11:08:00,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:08:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2018-11-23 11:08:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:08:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 57 transitions. [2018-11-23 11:08:00,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 57 transitions. [2018-11-23 11:08:00,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:00,534 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:08:00,534 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:08:00,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:08:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:08:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-11-23 11:08:00,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:00,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 36 states. [2018-11-23 11:08:00,592 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 36 states. [2018-11-23 11:08:00,592 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 36 states. [2018-11-23 11:08:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,596 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:08:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:08:00,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,598 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 42 states. [2018-11-23 11:08:00,598 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 42 states. [2018-11-23 11:08:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,602 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 11:08:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 11:08:00,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:00,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:00,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:08:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 11:08:00,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 30 [2018-11-23 11:08:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:00,607 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 11:08:00,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:08:00,607 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:08:00,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:08:00,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:00,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:00,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:00,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:00,610 INFO L82 PathProgramCache]: Analyzing trace with hash 162252576, now seen corresponding path program 1 times [2018-11-23 11:08:00,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:00,610 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 11:08:00,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:00,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:02,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:08:02,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:08:02,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:24 [2018-11-23 11:08:02,249 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:02,250 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~i~0_13]. (and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (store |v_#memory_int_21| main_~pa~0.base (store (select |v_#memory_int_21| main_~pa~0.base) main_~pa~0.offset v_main_~i~0_13)) |#memory_int|) (bvslt v_main_~i~0_13 (_ bv10 32)) (bvsge v_main_~i~0_13 (_ bv0 32))) [2018-11-23 11:08:02,250 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (bvslt .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:08:02,310 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 31 treesize of output 23 [2018-11-23 11:08:02,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-23 11:08:02,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:02,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:12 [2018-11-23 11:08:02,347 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:02,347 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (= |main_#t~mem11| .cse0) (bvslt .cse0 (_ bv10 32)) (bvsge .cse0 (_ bv0 32)))) [2018-11-23 11:08:02,348 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem11| (_ bv0 32)) (= |main_#t~mem11| (bvadd main_~i~0 (_ bv10 32))) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:08:02,572 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-23 11:08:02,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {1004#true} call ULTIMATE.init(); {1004#true} is VALID [2018-11-23 11:08:02,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {1004#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {1004#true} is VALID [2018-11-23 11:08:02,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {1004#true} assume true; {1004#true} is VALID [2018-11-23 11:08:02,616 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1004#true} {1004#true} #52#return; {1004#true} is VALID [2018-11-23 11:08:02,616 INFO L256 TraceCheckUtils]: 4: Hoare triple {1004#true} call #t~ret14 := main(); {1004#true} is VALID [2018-11-23 11:08:02,616 INFO L256 TraceCheckUtils]: 5: Hoare triple {1004#true} call init(); {1004#true} is VALID [2018-11-23 11:08:02,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {1004#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {1004#true} is VALID [2018-11-23 11:08:02,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {1004#true} assume true; {1004#true} is VALID [2018-11-23 11:08:02,618 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1004#true} {1004#true} #56#return; {1004#true} is VALID [2018-11-23 11:08:02,618 INFO L256 TraceCheckUtils]: 9: Hoare triple {1004#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1004#true} is VALID [2018-11-23 11:08:02,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {1004#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1039#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:02,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {1039#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:02,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:02,634 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1004#true} #58#return; {1050#(and (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:02,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {1050#(and (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1054#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} is VALID [2018-11-23 11:08:02,634 INFO L256 TraceCheckUtils]: 15: Hoare triple {1054#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1004#true} is VALID [2018-11-23 11:08:02,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {1004#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1039#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:02,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {1039#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:02,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:02,638 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1043#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1054#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} #60#return; {1070#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} is VALID [2018-11-23 11:08:02,639 INFO L273 TraceCheckUtils]: 20: Hoare triple {1070#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {1074#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:08:02,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {1074#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {1078#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} is VALID [2018-11-23 11:08:02,716 INFO L273 TraceCheckUtils]: 22: Hoare triple {1078#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (bvslt (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv10 32)) (bvsge (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1082#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd |main_#t~mem11| (_ bv4294967286 32)) main_~i~0) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:08:02,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {1082#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd |main_#t~mem11| (_ bv4294967286 32)) main_~i~0) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {1005#false} is VALID [2018-11-23 11:08:02,719 INFO L256 TraceCheckUtils]: 24: Hoare triple {1005#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1005#false} is VALID [2018-11-23 11:08:02,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {1005#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {1005#false} is VALID [2018-11-23 11:08:02,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {1005#false} assume true; {1005#false} is VALID [2018-11-23 11:08:02,720 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {1005#false} {1005#false} #62#return; {1005#false} is VALID [2018-11-23 11:08:02,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {1005#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {1005#false} is VALID [2018-11-23 11:08:02,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {1005#false} assume !false; {1005#false} is VALID [2018-11-23 11:08:02,722 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 11:08:02,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:08:02,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:08:02,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:08:02,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 11:08:02,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:02,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:08:02,783 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 11:08:02,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:08:02,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:08:02,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:08:02,784 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 10 states. [2018-11-23 11:08:04,640 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-23 11:08:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:04,883 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-11-23 11:08:04,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:08:04,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 11:08:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:08:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 11:08:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:08:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 11:08:04,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-23 11:08:04,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:04,994 INFO L225 Difference]: With dead ends: 51 [2018-11-23 11:08:04,995 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 11:08:04,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:08:04,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 11:08:05,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2018-11-23 11:08:05,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:05,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 34 states. [2018-11-23 11:08:05,110 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 34 states. [2018-11-23 11:08:05,110 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 34 states. [2018-11-23 11:08:05,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:05,114 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 11:08:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 11:08:05,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:05,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:05,116 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 44 states. [2018-11-23 11:08:05,116 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 44 states. [2018-11-23 11:08:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:05,119 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-23 11:08:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 11:08:05,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:05,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:05,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:05,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:08:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 11:08:05,123 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 30 [2018-11-23 11:08:05,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:05,124 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 11:08:05,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:08:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 11:08:05,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:08:05,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:05,125 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:05,125 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:05,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:05,126 INFO L82 PathProgramCache]: Analyzing trace with hash -12243191, now seen corresponding path program 1 times [2018-11-23 11:08:05,126 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:05,126 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 11:08:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:05,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:05,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:08:05,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:08:05,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:05,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:05,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:05,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-23 11:08:05,657 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:05,658 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_~i~0_14, |v_#memory_int_22|]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (and (= (select (select |#memory_int| main_~pa~0.base) .cse0) (bvadd main_~i~0 (_ bv10 32))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= .cse0 main_~pa~0.offset) (= (store |v_#memory_int_22| main_~pa~0.base (store (select |v_#memory_int_22| main_~pa~0.base) .cse0 v_main_~i~0_14)) |#memory_int|) (bvsge v_main_~i~0_14 (_ bv0 32)))) [2018-11-23 11:08:05,658 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_14]. (let ((.cse1 (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) .cse1))) (and (= .cse0 (bvadd main_~i~0 (_ bv10 32))) (= v_main_~i~0_14 .cse0) (bvslt v_main_~i~0_14 (_ bv10 32)) (= .cse1 main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32))))) [2018-11-23 11:08:06,051 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 36 treesize of output 30 [2018-11-23 11:08:06,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-23 11:08:06,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:06,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-23 11:08:06,120 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:06,121 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_14]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))))) (and (= |main_#t~mem11| .cse0) (= (bvadd .cse0 (_ bv4294967287 32)) main_~i~0) (= v_main_~i~0_14 .cse0) (bvslt v_main_~i~0_14 (_ bv10 32)) (bvsge v_main_~i~0_14 (_ bv0 32)))) [2018-11-23 11:08:06,121 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem11| (_ bv0 32)) (= main_~i~0 (bvadd |main_#t~mem11| (_ bv4294967287 32))) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:08:06,220 INFO L256 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2018-11-23 11:08:06,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,232 INFO L273 TraceCheckUtils]: 2: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1331#(= (_ bv0 32) |~#d1~0.offset|)} {1323#true} #52#return; {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret14 := main(); {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,240 INFO L256 TraceCheckUtils]: 5: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,246 INFO L273 TraceCheckUtils]: 7: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,246 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1331#(= (_ bv0 32) |~#d1~0.offset|)} {1331#(= (_ bv0 32) |~#d1~0.offset|)} #56#return; {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,247 INFO L256 TraceCheckUtils]: 9: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1359#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {1359#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,268 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {1331#(= (_ bv0 32) |~#d1~0.offset|)} #58#return; {1370#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {1370#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|) (= (_ bv0 32) |~#d1~0.offset|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1374#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,273 INFO L256 TraceCheckUtils]: 15: Hoare triple {1374#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1331#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:06,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1331#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1359#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {1359#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,279 INFO L273 TraceCheckUtils]: 18: Hoare triple {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:06,280 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1363#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {1374#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} #60#return; {1390#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= (_ bv0 32) |main_#t~ret8.offset|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} is VALID [2018-11-23 11:08:06,281 INFO L273 TraceCheckUtils]: 20: Hoare triple {1390#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= (_ bv0 32) |main_#t~ret8.offset|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {1394#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:08:06,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {1394#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {1398#(exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32))))} is VALID [2018-11-23 11:08:06,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {1398#(exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1402#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 11:08:06,317 INFO L273 TraceCheckUtils]: 23: Hoare triple {1402#(and (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32)))) (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1406#(exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32))))} is VALID [2018-11-23 11:08:06,327 INFO L273 TraceCheckUtils]: 24: Hoare triple {1406#(exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0) (= v_main_~i~0_14 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)))) (bvslt v_main_~i~0_14 (_ bv10 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_14) (_ bv8 32)) main_~pa~0.offset) (bvsge v_main_~i~0_14 (_ bv0 32))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1410#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv9 32)) |main_#t~mem11|) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:08:06,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {1410#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv9 32)) |main_#t~mem11|) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {1324#false} is VALID [2018-11-23 11:08:06,330 INFO L256 TraceCheckUtils]: 26: Hoare triple {1324#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1324#false} is VALID [2018-11-23 11:08:06,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {1324#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {1324#false} is VALID [2018-11-23 11:08:06,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-23 11:08:06,330 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1324#false} {1324#false} #62#return; {1324#false} is VALID [2018-11-23 11:08:06,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {1324#false} is VALID [2018-11-23 11:08:06,331 INFO L273 TraceCheckUtils]: 31: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2018-11-23 11:08:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:06,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:06,886 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-11-23 11:08:06,892 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 28 treesize of output 24 [2018-11-23 11:08:06,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 10 [2018-11-23 11:08:06,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:06,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:06,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:08:06,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:7 [2018-11-23 11:08:07,024 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:07,024 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_main_~i~0_17]. (let ((.cse0 (bvadd v_main_~i~0_17 (_ bv10 32)))) (let ((.cse1 (let ((.cse2 (bvmul (_ bv4 32) v_main_~i~0_17))) (select (select (store |#memory_int| main_~pd2~0.base (store (select |#memory_int| main_~pd2~0.base) (bvadd main_~pd2~0.offset .cse2 (_ bv48 32)) .cse0)) main_~pd1~0.base) (bvadd main_~pd1~0.offset .cse2 (_ bv48 32)))))) (or (not (bvslt .cse0 (_ bv10 32))) (not (bvslt v_main_~i~0_17 .cse1)) (not (bvsge .cse0 (_ bv0 32))) (bvslt (bvadd v_main_~i~0_17 (_ bv1 32)) .cse1)))) [2018-11-23 11:08:07,024 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset)) [2018-11-23 11:08:07,575 INFO L273 TraceCheckUtils]: 31: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2018-11-23 11:08:07,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {1324#false} is VALID [2018-11-23 11:08:07,576 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1323#true} {1324#false} #62#return; {1324#false} is VALID [2018-11-23 11:08:07,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {1323#true} assume true; {1323#true} is VALID [2018-11-23 11:08:07,577 INFO L273 TraceCheckUtils]: 27: Hoare triple {1323#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {1323#true} is VALID [2018-11-23 11:08:07,577 INFO L256 TraceCheckUtils]: 26: Hoare triple {1324#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1323#true} is VALID [2018-11-23 11:08:07,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {1450#(bvslt main_~i~0 |main_#t~mem11|)} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {1324#false} is VALID [2018-11-23 11:08:07,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {1454#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1450#(bvslt main_~i~0 |main_#t~mem11|)} is VALID [2018-11-23 11:08:07,580 INFO L273 TraceCheckUtils]: 23: Hoare triple {1458#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1454#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:07,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {1462#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1458#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} is VALID [2018-11-23 11:08:07,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {1466#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {1462#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:07,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {1470#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {1466#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:08:07,688 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} {1474#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} #60#return; {1470#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} is VALID [2018-11-23 11:08:07,688 INFO L273 TraceCheckUtils]: 18: Hoare triple {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} assume true; {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} is VALID [2018-11-23 11:08:07,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {1485#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} is VALID [2018-11-23 11:08:07,689 INFO L273 TraceCheckUtils]: 16: Hoare triple {1323#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1485#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 11:08:07,689 INFO L256 TraceCheckUtils]: 15: Hoare triple {1474#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1323#true} is VALID [2018-11-23 11:08:07,690 INFO L273 TraceCheckUtils]: 14: Hoare triple {1492#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1474#(and (= |~#d1~0.base| main_~pd1~0.base) (= main_~pd1~0.offset |~#d1~0.offset|))} is VALID [2018-11-23 11:08:07,691 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} {1323#true} #58#return; {1492#(and (= |main_#t~ret7.offset| |~#d1~0.offset|) (= |~#d1~0.base| |main_#t~ret7.base|))} is VALID [2018-11-23 11:08:07,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} assume true; {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} is VALID [2018-11-23 11:08:07,692 INFO L273 TraceCheckUtils]: 11: Hoare triple {1485#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1478#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|))} is VALID [2018-11-23 11:08:07,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {1323#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {1485#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 11:08:07,694 INFO L256 TraceCheckUtils]: 9: Hoare triple {1323#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1323#true} is VALID [2018-11-23 11:08:07,694 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1323#true} {1323#true} #56#return; {1323#true} is VALID [2018-11-23 11:08:07,694 INFO L273 TraceCheckUtils]: 7: Hoare triple {1323#true} assume true; {1323#true} is VALID [2018-11-23 11:08:07,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {1323#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {1323#true} is VALID [2018-11-23 11:08:07,695 INFO L256 TraceCheckUtils]: 5: Hoare triple {1323#true} call init(); {1323#true} is VALID [2018-11-23 11:08:07,695 INFO L256 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret14 := main(); {1323#true} is VALID [2018-11-23 11:08:07,695 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #52#return; {1323#true} is VALID [2018-11-23 11:08:07,695 INFO L273 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2018-11-23 11:08:07,696 INFO L273 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {1323#true} is VALID [2018-11-23 11:08:07,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2018-11-23 11:08:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:07,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:07,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 11:08:07,702 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 11:08:07,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:07,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:08:07,883 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 11:08:07,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:08:07,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:08:07,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:08:07,884 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 23 states. [2018-11-23 11:08:09,768 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 37 [2018-11-23 11:08:10,581 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2018-11-23 11:08:11,133 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-11-23 11:08:12,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:12,915 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 11:08:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:08:12,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 11:08:12,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2018-11-23 11:08:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 69 transitions. [2018-11-23 11:08:12,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 69 transitions. [2018-11-23 11:08:13,148 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:13,151 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:08:13,151 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:08:13,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:08:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:08:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-23 11:08:13,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:13,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 42 states. [2018-11-23 11:08:13,290 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 42 states. [2018-11-23 11:08:13,290 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 42 states. [2018-11-23 11:08:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:13,294 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 11:08:13,294 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 11:08:13,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:13,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:13,295 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 54 states. [2018-11-23 11:08:13,295 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 54 states. [2018-11-23 11:08:13,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:13,299 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 11:08:13,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 11:08:13,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:13,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:13,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:13,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:08:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:08:13,320 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 32 [2018-11-23 11:08:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:13,321 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:08:13,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:08:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:08:13,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:08:13,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:13,322 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:13,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:13,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:13,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1165644714, now seen corresponding path program 1 times [2018-11-23 11:08:13,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:13,324 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 11:08:13,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:13,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:13,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 11:08:13,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:08:13,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:13,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:13,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:13,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2018-11-23 11:08:13,960 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:13,960 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, v_main_~i~0_19]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (store |v_#memory_int_27| main_~pa~0.base (store (select |v_#memory_int_27| main_~pa~0.base) .cse0 v_main_~i~0_19)) |#memory_int|) (= .cse0 main_~pa~0.offset) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) .cse0)))) [2018-11-23 11:08:13,960 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_19]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (let ((.cse1 (select (select |#memory_int| main_~pa~0.base) .cse0))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= .cse0 main_~pa~0.offset) (= v_main_~i~0_19 .cse1) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) .cse1)))) [2018-11-23 11:08:14,283 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 36 treesize of output 30 [2018-11-23 11:08:14,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-11-23 11:08:14,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:12 [2018-11-23 11:08:14,363 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:14,364 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_19]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32))))) (and (= (bvadd main_~i~0 (_ bv8 32)) .cse0) (bvsge v_main_~i~0_19 (_ bv0 32)) (= |main_#t~mem11| .cse0) (= v_main_~i~0_19 .cse0) (bvslt v_main_~i~0_19 (_ bv10 32)))) [2018-11-23 11:08:14,364 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~i~0 (_ bv8 32)) |main_#t~mem11|) (bvsge |main_#t~mem11| (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:08:14,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2018-11-23 11:08:14,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,427 INFO L273 TraceCheckUtils]: 2: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1828#(= (_ bv0 32) |~#d2~0.offset|)} {1820#true} #52#return; {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret14 := main(); {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,428 INFO L256 TraceCheckUtils]: 5: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} call init(); {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,429 INFO L273 TraceCheckUtils]: 7: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,430 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1828#(= (_ bv0 32) |~#d2~0.offset|)} {1828#(= (_ bv0 32) |~#d2~0.offset|)} #56#return; {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,430 INFO L256 TraceCheckUtils]: 9: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1856#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,432 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,434 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1828#(= (_ bv0 32) |~#d2~0.offset|)} #58#return; {1867#(and (= (_ bv0 32) |~#d2~0.offset|) (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:14,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {1867#(and (= (_ bv0 32) |~#d2~0.offset|) (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1871#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,436 INFO L256 TraceCheckUtils]: 15: Hoare triple {1871#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1828#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:14,438 INFO L273 TraceCheckUtils]: 16: Hoare triple {1828#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1856#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {1856#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:14,441 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1860#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1871#(and (= (_ bv0 32) |~#d2~0.offset|) (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} #60#return; {1887#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset (_ bv0 32)) (= (_ bv0 32) |main_#t~ret8.offset|))} is VALID [2018-11-23 11:08:14,442 INFO L273 TraceCheckUtils]: 20: Hoare triple {1887#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset (_ bv0 32)) (= (_ bv0 32) |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {1891#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:14,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {1891#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset (_ bv0 32)) (= main_~pd2~0.offset (_ bv0 32)))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {1895#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32))))))} is VALID [2018-11-23 11:08:14,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {1895#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32))))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1895#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32))))))} is VALID [2018-11-23 11:08:14,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {1895#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32))))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1902#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} is VALID [2018-11-23 11:08:14,458 INFO L273 TraceCheckUtils]: 24: Hoare triple {1902#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1902#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} is VALID [2018-11-23 11:08:14,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {1902#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1909#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} is VALID [2018-11-23 11:08:14,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {1909#(exists ((v_main_~i~0_19 (_ BitVec 32))) (and (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvsge v_main_~i~0_19 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)) main_~pa~0.offset) (= v_main_~i~0_19 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_19) (_ bv8 32)))) (bvslt v_main_~i~0_19 (_ bv10 32))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1913#(and (= (bvadd main_~i~0 (_ bv8 32)) |main_#t~mem11|) (bvsge |main_#t~mem11| (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:08:14,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {1913#(and (= (bvadd main_~i~0 (_ bv8 32)) |main_#t~mem11|) (bvsge |main_#t~mem11| (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {1821#false} is VALID [2018-11-23 11:08:14,479 INFO L256 TraceCheckUtils]: 28: Hoare triple {1821#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1821#false} is VALID [2018-11-23 11:08:14,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {1821#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {1821#false} is VALID [2018-11-23 11:08:14,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {1821#false} assume true; {1821#false} is VALID [2018-11-23 11:08:14,480 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1821#false} {1821#false} #62#return; {1821#false} is VALID [2018-11-23 11:08:14,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {1821#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {1821#false} is VALID [2018-11-23 11:08:14,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2018-11-23 11:08:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:14,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:14,944 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 14 treesize of output 12 [2018-11-23 11:08:14,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 5 [2018-11-23 11:08:14,954 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:14,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:14,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:08:14,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:7 [2018-11-23 11:08:15,038 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:15,039 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, main_~i~0]. (or (not (bvsge main_~i~0 (_ bv0 32))) (not (bvslt main_~i~0 (_ bv10 32))) (bvslt (bvadd main_~i~0 (_ bv4294967288 32)) (let ((.cse0 (bvmul (_ bv4 32) main_~i~0))) (select (select (store |#memory_int| main_~pd2~0.base (store (select |#memory_int| main_~pd2~0.base) (bvadd .cse0 main_~pd2~0.offset (_ bv8 32)) main_~i~0)) main_~pd1~0.base) (bvadd main_~pd1~0.offset .cse0 (_ bv8 32)))))) [2018-11-23 11:08:15,039 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset)) [2018-11-23 11:08:15,650 INFO L273 TraceCheckUtils]: 33: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2018-11-23 11:08:15,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {1821#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {1821#false} is VALID [2018-11-23 11:08:15,651 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {1820#true} {1821#false} #62#return; {1821#false} is VALID [2018-11-23 11:08:15,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {1820#true} assume true; {1820#true} is VALID [2018-11-23 11:08:15,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {1820#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {1820#true} is VALID [2018-11-23 11:08:15,651 INFO L256 TraceCheckUtils]: 28: Hoare triple {1821#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {1820#true} is VALID [2018-11-23 11:08:15,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {1953#(bvslt main_~i~0 |main_#t~mem11|)} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {1821#false} is VALID [2018-11-23 11:08:15,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {1957#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1953#(bvslt main_~i~0 |main_#t~mem11|)} is VALID [2018-11-23 11:08:15,662 INFO L273 TraceCheckUtils]: 25: Hoare triple {1961#(bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1957#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:15,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {1961#(bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1961#(bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:15,684 INFO L273 TraceCheckUtils]: 23: Hoare triple {1968#(bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {1961#(bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:15,684 INFO L273 TraceCheckUtils]: 22: Hoare triple {1968#(bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1968#(bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:15,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {1975#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {1968#(bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:15,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {1979#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {1975#(and (= main_~pd2~0.base main_~pd1~0.base) (= main_~pd1~0.offset main_~pd2~0.offset))} is VALID [2018-11-23 11:08:15,764 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1983#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} #60#return; {1979#(and (= main_~pd1~0.base |main_#t~ret8.base|) (= main_~pd1~0.offset |main_#t~ret8.offset|))} is VALID [2018-11-23 11:08:15,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:15,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {1994#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:15,765 INFO L273 TraceCheckUtils]: 16: Hoare triple {1820#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1994#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:15,766 INFO L256 TraceCheckUtils]: 15: Hoare triple {1983#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {1820#true} is VALID [2018-11-23 11:08:15,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {2001#(and (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {1983#(and (= main_~pd1~0.base |~#d2~0.base|) (= main_~pd1~0.offset |~#d2~0.offset|))} is VALID [2018-11-23 11:08:15,767 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {1820#true} #58#return; {2001#(and (= |main_#t~ret7.offset| |~#d2~0.offset|) (= |main_#t~ret7.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:15,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:15,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {1994#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {1987#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:15,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {1820#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {1994#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:15,769 INFO L256 TraceCheckUtils]: 9: Hoare triple {1820#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {1820#true} is VALID [2018-11-23 11:08:15,769 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {1820#true} {1820#true} #56#return; {1820#true} is VALID [2018-11-23 11:08:15,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {1820#true} assume true; {1820#true} is VALID [2018-11-23 11:08:15,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {1820#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {1820#true} is VALID [2018-11-23 11:08:15,770 INFO L256 TraceCheckUtils]: 5: Hoare triple {1820#true} call init(); {1820#true} is VALID [2018-11-23 11:08:15,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {1820#true} call #t~ret14 := main(); {1820#true} is VALID [2018-11-23 11:08:15,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1820#true} {1820#true} #52#return; {1820#true} is VALID [2018-11-23 11:08:15,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {1820#true} assume true; {1820#true} is VALID [2018-11-23 11:08:15,771 INFO L273 TraceCheckUtils]: 1: Hoare triple {1820#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {1820#true} is VALID [2018-11-23 11:08:15,771 INFO L256 TraceCheckUtils]: 0: Hoare triple {1820#true} call ULTIMATE.init(); {1820#true} is VALID [2018-11-23 11:08:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:15,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:15,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-23 11:08:15,776 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 11:08:15,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:15,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:08:15,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:15,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:08:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:08:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:08:15,937 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 23 states. [2018-11-23 11:08:17,799 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-23 11:08:19,714 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 11:08:20,329 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2018-11-23 11:08:21,366 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 11:08:21,802 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-11-23 11:08:22,319 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-11-23 11:08:22,641 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-23 11:08:23,076 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-23 11:08:23,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:23,690 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-23 11:08:23,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:08:23,691 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 11:08:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:23,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 11:08:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:23,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2018-11-23 11:08:23,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2018-11-23 11:08:23,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:23,995 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:08:23,995 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:08:23,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=377, Invalid=1515, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:08:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:08:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2018-11-23 11:08:24,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:24,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 46 states. [2018-11-23 11:08:24,124 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 46 states. [2018-11-23 11:08:24,124 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 46 states. [2018-11-23 11:08:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:24,128 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-23 11:08:24,128 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-23 11:08:24,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:24,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:24,129 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 60 states. [2018-11-23 11:08:24,129 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 60 states. [2018-11-23 11:08:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:24,132 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-23 11:08:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-23 11:08:24,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:24,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:24,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:24,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:08:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 11:08:24,135 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 34 [2018-11-23 11:08:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:24,135 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 11:08:24,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:08:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 11:08:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:08:24,137 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:24,137 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:24,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1207040200, now seen corresponding path program 2 times [2018-11-23 11:08:24,138 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:24,138 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 11:08:24,158 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:08:24,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:08:24,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:24,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:24,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:08:24,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 11:08:24,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:24,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-11-23 11:08:24,781 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:24,782 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_~i~0_26, |v_#memory_int_32|]. (let ((.cse0 (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (and (= .cse0 main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (select (select |#memory_int| main_~pa~0.base) .cse0) (bvadd main_~i~0 (_ bv10 32))) (= main_~pd2~0.offset (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_32| main_~pa~0.base (store (select |v_#memory_int_32| main_~pa~0.base) .cse0 v_main_~i~0_26))))) [2018-11-23 11:08:24,782 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_26]. (let ((.cse0 (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (let ((.cse1 (select (select |#memory_int| main_~pa~0.base) .cse0))) (and (= .cse0 main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (bvsge v_main_~i~0_26 (_ bv0 32)) (= v_main_~i~0_26 .cse1) (= .cse1 (bvadd main_~i~0 (_ bv10 32))) (= main_~pd2~0.offset (_ bv0 32))))) [2018-11-23 11:08:26,212 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 39 treesize of output 33 [2018-11-23 11:08:26,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-23 11:08:26,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:15 [2018-11-23 11:08:26,300 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:26,301 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_26]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))))) (and (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 .cse0) (bvsge v_main_~i~0_26 (_ bv0 32)) (= main_~pd2~0.offset (_ bv0 32)) (= |main_#t~mem11| .cse0) (= (bvadd .cse0 (_ bv4294967290 32)) main_~i~0))) [2018-11-23 11:08:26,301 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem11| (_ bv0 32)) (= main_~i~0 (bvadd |main_#t~mem11| (_ bv4294967290 32))) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:08:26,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {2369#true} call ULTIMATE.init(); {2369#true} is VALID [2018-11-23 11:08:26,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {2369#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2377#(= (_ bv0 32) |~#d1~0.offset|)} {2369#true} #52#return; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,406 INFO L256 TraceCheckUtils]: 4: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret14 := main(); {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,406 INFO L256 TraceCheckUtils]: 5: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,407 INFO L273 TraceCheckUtils]: 6: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,408 INFO L273 TraceCheckUtils]: 7: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,409 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2377#(= (_ bv0 32) |~#d1~0.offset|)} {2377#(= (_ bv0 32) |~#d1~0.offset|)} #56#return; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,409 INFO L256 TraceCheckUtils]: 9: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,410 INFO L273 TraceCheckUtils]: 10: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,413 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2377#(= (_ bv0 32) |~#d1~0.offset|)} {2377#(= (_ bv0 32) |~#d1~0.offset|)} #58#return; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,414 INFO L256 TraceCheckUtils]: 15: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret8.base, #t~ret8.offset := get_dummy(); {2377#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:08:26,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {2377#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {2423#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:26,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {2423#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {2427#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:26,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {2427#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {2427#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:08:26,417 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2427#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {2377#(= (_ bv0 32) |~#d1~0.offset|)} #60#return; {2434#(= (_ bv0 32) |main_#t~ret8.offset|)} is VALID [2018-11-23 11:08:26,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {2434#(= (_ bv0 32) |main_#t~ret8.offset|)} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {2438#(= main_~pd2~0.offset (_ bv0 32))} is VALID [2018-11-23 11:08:26,430 INFO L273 TraceCheckUtils]: 21: Hoare triple {2438#(= main_~pd2~0.offset (_ bv0 32))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {2442#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0))))} is VALID [2018-11-23 11:08:26,431 INFO L273 TraceCheckUtils]: 22: Hoare triple {2442#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2442#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0))))} is VALID [2018-11-23 11:08:26,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {2442#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967286 32)) main_~i~0))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2449#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:26,448 INFO L273 TraceCheckUtils]: 24: Hoare triple {2449#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2449#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:26,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {2449#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967287 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2456#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967288 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))))} is VALID [2018-11-23 11:08:26,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {2456#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967288 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2460#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967288 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))))} is VALID [2018-11-23 11:08:26,485 INFO L273 TraceCheckUtils]: 27: Hoare triple {2460#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967288 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2464#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967289 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:26,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {2464#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967289 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2468#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967289 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:26,553 INFO L273 TraceCheckUtils]: 29: Hoare triple {2468#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967289 32)) main_~i~0) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2472#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967290 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:26,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {2472#(and (exists ((v_main_~i~0_26 (_ BitVec 32))) (and (= (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)) main_~pa~0.offset) (bvslt v_main_~i~0_26 (_ bv10 32)) (= v_main_~i~0_26 (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32)))) (bvsge v_main_~i~0_26 (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~pa~0.base) (bvadd main_~pd2~0.offset (bvmul (_ bv4 32) v_main_~i~0_26) (_ bv8 32))) (_ bv4294967290 32)) main_~i~0))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2476#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv6 32)) |main_#t~mem11|) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:08:26,577 INFO L273 TraceCheckUtils]: 31: Hoare triple {2476#(and (bvsge |main_#t~mem11| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv6 32)) |main_#t~mem11|) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {2370#false} is VALID [2018-11-23 11:08:26,577 INFO L256 TraceCheckUtils]: 32: Hoare triple {2370#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {2370#false} is VALID [2018-11-23 11:08:26,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {2370#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {2370#false} is VALID [2018-11-23 11:08:26,578 INFO L273 TraceCheckUtils]: 34: Hoare triple {2370#false} assume true; {2370#false} is VALID [2018-11-23 11:08:26,578 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2370#false} {2370#false} #62#return; {2370#false} is VALID [2018-11-23 11:08:26,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {2370#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {2370#false} is VALID [2018-11-23 11:08:26,579 INFO L273 TraceCheckUtils]: 37: Hoare triple {2370#false} assume !false; {2370#false} is VALID [2018-11-23 11:08:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:08:26,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:28,422 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:08:28,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:1 [2018-11-23 11:08:28,532 INFO L273 TraceCheckUtils]: 37: Hoare triple {2370#false} assume !false; {2370#false} is VALID [2018-11-23 11:08:28,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {2370#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {2370#false} is VALID [2018-11-23 11:08:28,532 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2369#true} {2370#false} #62#return; {2370#false} is VALID [2018-11-23 11:08:28,533 INFO L273 TraceCheckUtils]: 34: Hoare triple {2369#true} assume true; {2369#true} is VALID [2018-11-23 11:08:28,533 INFO L273 TraceCheckUtils]: 33: Hoare triple {2369#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {2369#true} is VALID [2018-11-23 11:08:28,533 INFO L256 TraceCheckUtils]: 32: Hoare triple {2370#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {2369#true} is VALID [2018-11-23 11:08:28,535 INFO L273 TraceCheckUtils]: 31: Hoare triple {2516#(bvslt main_~i~0 |main_#t~mem11|)} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {2370#false} is VALID [2018-11-23 11:08:28,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {2520#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2516#(bvslt main_~i~0 |main_#t~mem11|)} is VALID [2018-11-23 11:08:28,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {2524#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2520#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:28,539 INFO L273 TraceCheckUtils]: 28: Hoare triple {2528#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2524#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} is VALID [2018-11-23 11:08:28,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {2532#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt main_~i~0 |main_#t~mem11|)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2528#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,573 INFO L273 TraceCheckUtils]: 26: Hoare triple {2536#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2532#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt main_~i~0 |main_#t~mem11|)))} is VALID [2018-11-23 11:08:28,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {2540#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2536#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {2540#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2540#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {2540#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {2547#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,730 INFO L273 TraceCheckUtils]: 21: Hoare triple {2369#true} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {2547#(or (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:28,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {2369#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {2369#true} {2369#true} #60#return; {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L273 TraceCheckUtils]: 18: Hoare triple {2369#true} assume true; {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L273 TraceCheckUtils]: 17: Hoare triple {2369#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {2369#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L256 TraceCheckUtils]: 15: Hoare triple {2369#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {2369#true} is VALID [2018-11-23 11:08:28,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {2369#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {2369#true} is VALID [2018-11-23 11:08:28,732 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2369#true} {2369#true} #58#return; {2369#true} is VALID [2018-11-23 11:08:28,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {2369#true} assume true; {2369#true} is VALID [2018-11-23 11:08:28,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {2369#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {2369#true} is VALID [2018-11-23 11:08:28,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {2369#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {2369#true} is VALID [2018-11-23 11:08:28,732 INFO L256 TraceCheckUtils]: 9: Hoare triple {2369#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {2369#true} {2369#true} #56#return; {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {2369#true} assume true; {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {2369#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L256 TraceCheckUtils]: 5: Hoare triple {2369#true} call init(); {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {2369#true} call #t~ret14 := main(); {2369#true} is VALID [2018-11-23 11:08:28,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2369#true} {2369#true} #52#return; {2369#true} is VALID [2018-11-23 11:08:28,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {2369#true} assume true; {2369#true} is VALID [2018-11-23 11:08:28,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {2369#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {2369#true} is VALID [2018-11-23 11:08:28,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {2369#true} call ULTIMATE.init(); {2369#true} is VALID [2018-11-23 11:08:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:28,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:28,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2018-11-23 11:08:28,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-11-23 11:08:28,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:28,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:08:29,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:29,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:08:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:08:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:08:29,182 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 23 states. [2018-11-23 11:08:33,388 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 11:08:34,028 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2018-11-23 11:08:34,461 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2018-11-23 11:08:34,982 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2018-11-23 11:08:35,348 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2018-11-23 11:08:35,767 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-11-23 11:08:36,081 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-11-23 11:08:37,704 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 23 [2018-11-23 11:08:38,119 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2018-11-23 11:08:38,563 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2018-11-23 11:08:38,892 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2018-11-23 11:08:39,569 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-23 11:08:40,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:40,528 INFO L93 Difference]: Finished difference Result 91 states and 102 transitions. [2018-11-23 11:08:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:08:40,528 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 38 [2018-11-23 11:08:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 85 transitions. [2018-11-23 11:08:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:08:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 85 transitions. [2018-11-23 11:08:40,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 85 transitions. [2018-11-23 11:08:41,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:41,432 INFO L225 Difference]: With dead ends: 91 [2018-11-23 11:08:41,432 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 11:08:41,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 811 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=702, Invalid=2268, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 11:08:41,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 11:08:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 56. [2018-11-23 11:08:41,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:41,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 56 states. [2018-11-23 11:08:41,642 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 56 states. [2018-11-23 11:08:41,642 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 56 states. [2018-11-23 11:08:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:41,646 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-23 11:08:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-23 11:08:41,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:41,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:41,647 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 84 states. [2018-11-23 11:08:41,647 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 84 states. [2018-11-23 11:08:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:41,651 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-23 11:08:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-23 11:08:41,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:41,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:41,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:41,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:08:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-23 11:08:41,654 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 38 [2018-11-23 11:08:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:41,655 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-23 11:08:41,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:08:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 11:08:41,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 11:08:41,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:41,656 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:41,656 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:41,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1716131803, now seen corresponding path program 1 times [2018-11-23 11:08:41,656 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:41,657 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 11:08:41,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:08:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:41,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:41,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-23 11:08:41,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-11-23 11:08:41,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-11-23 11:08:42,115 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-23 11:08:42,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,120 INFO L273 TraceCheckUtils]: 2: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,120 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} {3062#true} #52#return; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,122 INFO L256 TraceCheckUtils]: 4: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret14 := main(); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,122 INFO L256 TraceCheckUtils]: 5: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,124 INFO L273 TraceCheckUtils]: 6: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,126 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} #56#return; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,126 INFO L256 TraceCheckUtils]: 9: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret7.base, #t~ret7.offset := get_dummy(); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {3098#(and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} is VALID [2018-11-23 11:08:42,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {3098#(and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.base| |get_dummy_#t~ite5.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3102#(and (= |get_dummy_#res.base| |~#d1~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:08:42,131 INFO L273 TraceCheckUtils]: 12: Hoare triple {3102#(and (= |get_dummy_#res.base| |~#d1~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} assume true; {3102#(and (= |get_dummy_#res.base| |~#d1~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} is VALID [2018-11-23 11:08:42,131 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3102#(and (= |get_dummy_#res.base| |~#d1~0.base|) (not (= |~#d1~0.base| |~#d2~0.base|)))} {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} #58#return; {3109#(not (= |main_#t~ret7.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,133 INFO L273 TraceCheckUtils]: 14: Hoare triple {3109#(not (= |main_#t~ret7.base| |~#d2~0.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,133 INFO L256 TraceCheckUtils]: 15: Hoare triple {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {3062#true} is VALID [2018-11-23 11:08:42,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {3062#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3120#(= |get_dummy_#t~ite5.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {3120#(= |get_dummy_#t~ite5.base| |~#d2~0.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,135 INFO L273 TraceCheckUtils]: 18: Hoare triple {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} assume true; {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,136 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} #60#return; {3131#(not (= main_~pd1~0.base |main_#t~ret8.base|))} is VALID [2018-11-23 11:08:42,137 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(not (= main_~pd1~0.base |main_#t~ret8.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {3135#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:08:42,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {3135#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {3063#false} is VALID [2018-11-23 11:08:42,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,139 INFO L273 TraceCheckUtils]: 24: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,140 INFO L273 TraceCheckUtils]: 25: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,140 INFO L273 TraceCheckUtils]: 26: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,141 INFO L273 TraceCheckUtils]: 27: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,141 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,141 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,141 INFO L273 TraceCheckUtils]: 30: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,142 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {3063#false} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {3063#false} is VALID [2018-11-23 11:08:42,142 INFO L256 TraceCheckUtils]: 34: Hoare triple {3063#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {3063#false} is VALID [2018-11-23 11:08:42,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {3063#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {3063#false} is VALID [2018-11-23 11:08:42,143 INFO L273 TraceCheckUtils]: 36: Hoare triple {3063#false} assume true; {3063#false} is VALID [2018-11-23 11:08:42,143 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3063#false} {3063#false} #62#return; {3063#false} is VALID [2018-11-23 11:08:42,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {3063#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {3063#false} is VALID [2018-11-23 11:08:42,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-23 11:08:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 11:08:42,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:42,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {3063#false} assume !false; {3063#false} is VALID [2018-11-23 11:08:42,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {3063#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {3063#false} is VALID [2018-11-23 11:08:42,414 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3062#true} {3063#false} #62#return; {3063#false} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {3062#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {3062#true} is VALID [2018-11-23 11:08:42,415 INFO L256 TraceCheckUtils]: 34: Hoare triple {3063#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {3062#true} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 33: Hoare triple {3063#false} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {3063#false} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 31: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,415 INFO L273 TraceCheckUtils]: 30: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,416 INFO L273 TraceCheckUtils]: 29: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,416 INFO L273 TraceCheckUtils]: 27: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,416 INFO L273 TraceCheckUtils]: 25: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,417 INFO L273 TraceCheckUtils]: 24: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,417 INFO L273 TraceCheckUtils]: 23: Hoare triple {3063#false} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3063#false} is VALID [2018-11-23 11:08:42,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {3063#false} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3063#false} is VALID [2018-11-23 11:08:42,423 INFO L273 TraceCheckUtils]: 21: Hoare triple {3135#(not (= main_~pd2~0.base main_~pd1~0.base))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {3063#false} is VALID [2018-11-23 11:08:42,423 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(not (= main_~pd1~0.base |main_#t~ret8.base|))} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {3135#(not (= main_~pd2~0.base main_~pd1~0.base))} is VALID [2018-11-23 11:08:42,424 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} #60#return; {3131#(not (= main_~pd1~0.base |main_#t~ret8.base|))} is VALID [2018-11-23 11:08:42,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} assume true; {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,425 INFO L273 TraceCheckUtils]: 17: Hoare triple {3120#(= |get_dummy_#t~ite5.base| |~#d2~0.base|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3124#(= |get_dummy_#res.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {3062#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3120#(= |get_dummy_#t~ite5.base| |~#d2~0.base|)} is VALID [2018-11-23 11:08:42,425 INFO L256 TraceCheckUtils]: 15: Hoare triple {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} call #t~ret8.base, #t~ret8.offset := get_dummy(); {3062#true} is VALID [2018-11-23 11:08:42,426 INFO L273 TraceCheckUtils]: 14: Hoare triple {3109#(not (= |main_#t~ret7.base| |~#d2~0.base|))} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3113#(not (= main_~pd1~0.base |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,427 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3274#(or (not (= |get_dummy_#res.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} #58#return; {3109#(not (= |main_#t~ret7.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,428 INFO L273 TraceCheckUtils]: 12: Hoare triple {3274#(or (not (= |get_dummy_#res.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} assume true; {3274#(or (not (= |get_dummy_#res.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,428 INFO L273 TraceCheckUtils]: 11: Hoare triple {3281#(or (not (= |get_dummy_#t~ite5.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3274#(or (not (= |get_dummy_#res.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {3062#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {3281#(or (not (= |get_dummy_#t~ite5.base| |~#d2~0.base|)) (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,429 INFO L256 TraceCheckUtils]: 9: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret7.base, #t~ret7.offset := get_dummy(); {3062#true} is VALID [2018-11-23 11:08:42,430 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3062#true} {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} #56#return; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {3062#true} assume true; {3062#true} is VALID [2018-11-23 11:08:42,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {3062#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {3062#true} is VALID [2018-11-23 11:08:42,431 INFO L256 TraceCheckUtils]: 5: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call init(); {3062#true} is VALID [2018-11-23 11:08:42,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} call #t~ret14 := main(); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} {3062#true} #52#return; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} assume true; {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,435 INFO L273 TraceCheckUtils]: 1: Hoare triple {3062#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {3070#(not (= |~#d1~0.base| |~#d2~0.base|))} is VALID [2018-11-23 11:08:42,435 INFO L256 TraceCheckUtils]: 0: Hoare triple {3062#true} call ULTIMATE.init(); {3062#true} is VALID [2018-11-23 11:08:42,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 11:08:42,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:42,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-11-23 11:08:42,441 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 11:08:42,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:42,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:08:42,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:42,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:08:42,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:08:42,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:08:42,502 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 13 states. [2018-11-23 11:08:44,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:44,187 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-11-23 11:08:44,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:08:44,187 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 11:08:44,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:44,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:08:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 11:08:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:08:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2018-11-23 11:08:44,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 56 transitions. [2018-11-23 11:08:44,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:44,283 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:08:44,284 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:08:44,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:08:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:08:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2018-11-23 11:08:44,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:44,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 54 states. [2018-11-23 11:08:44,583 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 54 states. [2018-11-23 11:08:44,583 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 54 states. [2018-11-23 11:08:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:44,587 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:08:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:08:44,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:44,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:44,588 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 72 states. [2018-11-23 11:08:44,588 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 72 states. [2018-11-23 11:08:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:44,591 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2018-11-23 11:08:44,591 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-11-23 11:08:44,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:44,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:44,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:44,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:08:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2018-11-23 11:08:44,594 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 40 [2018-11-23 11:08:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:44,595 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2018-11-23 11:08:44,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:08:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2018-11-23 11:08:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:08:44,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:44,596 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:44,596 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:44,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1910379074, now seen corresponding path program 2 times [2018-11-23 11:08:44,597 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:44,597 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:44,613 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:08:44,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:08:44,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:44,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:45,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:08:45,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 11:08:45,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:45,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:45,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:45,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2018-11-23 11:08:45,178 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:45,179 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_main_~i~0_43, |v_#memory_int_42|]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (and (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) .cse0)) (= main_~pd2~0.offset (_ bv0 32)) (= |#memory_int| (store |v_#memory_int_42| main_~pa~0.base (store (select |v_#memory_int_42| main_~pa~0.base) .cse0 v_main_~i~0_43))) (= main_~pa~0.offset .cse0) (bvsge v_main_~i~0_43 (_ bv0 32)))) [2018-11-23 11:08:45,179 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_43]. (let ((.cse1 (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) .cse1))) (and (= v_main_~i~0_43 .cse0) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) .cse0) (= main_~pd2~0.offset (_ bv0 32)) (= main_~pa~0.offset .cse1) (bvsge v_main_~i~0_43 (_ bv0 32))))) [2018-11-23 11:08:46,732 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 39 treesize of output 33 [2018-11-23 11:08:46,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-23 11:08:46,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:46,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:46,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:46,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:15 [2018-11-23 11:08:46,792 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:46,792 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_43]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32))))) (and (= v_main_~i~0_43 .cse0) (= (bvadd main_~i~0 (_ bv4 32)) .cse0) (= |main_#t~mem11| .cse0) (bvslt v_main_~i~0_43 (_ bv10 32)) (= main_~pd2~0.offset (_ bv0 32)) (bvsge v_main_~i~0_43 (_ bv0 32)))) [2018-11-23 11:08:46,792 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsge |main_#t~mem11| (_ bv0 32)) (= |main_#t~mem11| (bvadd main_~i~0 (_ bv4 32))) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32))) [2018-11-23 11:08:46,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:08:46,924 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3689#(= (_ bv0 32) |~#d2~0.offset|)} {3681#true} #52#return; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret14 := main(); {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,928 INFO L256 TraceCheckUtils]: 5: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} call init(); {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,930 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3689#(= (_ bv0 32) |~#d2~0.offset|)} {3689#(= (_ bv0 32) |~#d2~0.offset|)} #56#return; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,930 INFO L256 TraceCheckUtils]: 9: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,931 INFO L273 TraceCheckUtils]: 12: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} assume true; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,932 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3689#(= (_ bv0 32) |~#d2~0.offset|)} {3689#(= (_ bv0 32) |~#d2~0.offset|)} #58#return; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,933 INFO L256 TraceCheckUtils]: 15: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} call #t~ret8.base, #t~ret8.offset := get_dummy(); {3689#(= (_ bv0 32) |~#d2~0.offset|)} is VALID [2018-11-23 11:08:46,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {3689#(= (_ bv0 32) |~#d2~0.offset|)} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3735#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} is VALID [2018-11-23 11:08:46,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {3735#(and (= |get_dummy_#t~ite5.offset| |~#d2~0.offset|) (= |get_dummy_#t~ite5.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3739#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:46,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {3739#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} assume true; {3739#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} is VALID [2018-11-23 11:08:46,936 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3739#(and (= |get_dummy_#res.base| |~#d2~0.base|) (= (_ bv0 32) |~#d2~0.offset|) (= |get_dummy_#res.offset| |~#d2~0.offset|))} {3689#(= (_ bv0 32) |~#d2~0.offset|)} #60#return; {3746#(= (_ bv0 32) |main_#t~ret8.offset|)} is VALID [2018-11-23 11:08:46,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {3746#(= (_ bv0 32) |main_#t~ret8.offset|)} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {3750#(= main_~pd2~0.offset (_ bv0 32))} is VALID [2018-11-23 11:08:46,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {3750#(= main_~pd2~0.offset (_ bv0 32))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {3754#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))))} is VALID [2018-11-23 11:08:46,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {3754#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3754#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))))} is VALID [2018-11-23 11:08:46,950 INFO L273 TraceCheckUtils]: 23: Hoare triple {3754#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3761#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,952 INFO L273 TraceCheckUtils]: 24: Hoare triple {3761#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3761#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {3761#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3768#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {3768#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3768#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,969 INFO L273 TraceCheckUtils]: 27: Hoare triple {3768#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv8 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3775#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {3775#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3779#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,977 INFO L273 TraceCheckUtils]: 29: Hoare triple {3779#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv7 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3783#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,980 INFO L273 TraceCheckUtils]: 30: Hoare triple {3783#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3783#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:46,990 INFO L273 TraceCheckUtils]: 31: Hoare triple {3783#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3790#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))))))} is VALID [2018-11-23 11:08:46,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {3790#(and (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3794#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))))))} is VALID [2018-11-23 11:08:46,999 INFO L273 TraceCheckUtils]: 33: Hoare triple {3794#(and (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.offset (_ bv0 32)) (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3798#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:08:47,007 INFO L273 TraceCheckUtils]: 34: Hoare triple {3798#(and (exists ((v_main_~i~0_43 (_ BitVec 32))) (and (= v_main_~i~0_43 (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_43 (_ bv10 32)) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_43) main_~pd2~0.offset)) (bvsge v_main_~i~0_43 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3802#(and (= (bvadd |main_#t~mem11| (_ bv4294967292 32)) main_~i~0) (bvsge |main_#t~mem11| (_ bv0 32)) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} is VALID [2018-11-23 11:08:47,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {3802#(and (= (bvadd |main_#t~mem11| (_ bv4294967292 32)) main_~i~0) (bvsge |main_#t~mem11| (_ bv0 32)) (= main_~pd2~0.offset (_ bv0 32)) (bvslt |main_#t~mem11| (_ bv10 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {3682#false} is VALID [2018-11-23 11:08:47,009 INFO L256 TraceCheckUtils]: 36: Hoare triple {3682#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {3682#false} is VALID [2018-11-23 11:08:47,009 INFO L273 TraceCheckUtils]: 37: Hoare triple {3682#false} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {3682#false} is VALID [2018-11-23 11:08:47,010 INFO L273 TraceCheckUtils]: 38: Hoare triple {3682#false} assume true; {3682#false} is VALID [2018-11-23 11:08:47,010 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3682#false} {3682#false} #62#return; {3682#false} is VALID [2018-11-23 11:08:47,010 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {3682#false} is VALID [2018-11-23 11:08:47,010 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:08:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:08:47,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:48,917 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:08:48,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:48,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:48,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:1 [2018-11-23 11:08:49,043 INFO L273 TraceCheckUtils]: 41: Hoare triple {3682#false} assume !false; {3682#false} is VALID [2018-11-23 11:08:49,043 INFO L273 TraceCheckUtils]: 40: Hoare triple {3682#false} assume 0bv32 == #t~ret13;havoc #t~ret13; {3682#false} is VALID [2018-11-23 11:08:49,044 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {3681#true} {3682#false} #62#return; {3682#false} is VALID [2018-11-23 11:08:49,044 INFO L273 TraceCheckUtils]: 38: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:08:49,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {3681#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {3681#true} is VALID [2018-11-23 11:08:49,044 INFO L256 TraceCheckUtils]: 36: Hoare triple {3682#false} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {3681#true} is VALID [2018-11-23 11:08:49,044 INFO L273 TraceCheckUtils]: 35: Hoare triple {3842#(bvslt main_~i~0 |main_#t~mem11|)} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {3682#false} is VALID [2018-11-23 11:08:49,045 INFO L273 TraceCheckUtils]: 34: Hoare triple {3846#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3842#(bvslt main_~i~0 |main_#t~mem11|)} is VALID [2018-11-23 11:08:49,047 INFO L273 TraceCheckUtils]: 33: Hoare triple {3850#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3846#(bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 11:08:49,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {3854#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3850#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 |main_#t~mem11|)))} is VALID [2018-11-23 11:08:49,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {3858#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3854#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,070 INFO L273 TraceCheckUtils]: 30: Hoare triple {3858#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3858#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {3865#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt main_~i~0 |main_#t~mem11|)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3858#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {3869#(or (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3865#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt main_~i~0 |main_#t~mem11|)))} is VALID [2018-11-23 11:08:49,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {3873#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3869#(or (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,192 INFO L273 TraceCheckUtils]: 26: Hoare triple {3873#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3873#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 11:08:49,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {3880#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3873#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 11:08:49,291 INFO L273 TraceCheckUtils]: 24: Hoare triple {3880#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3880#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,390 INFO L273 TraceCheckUtils]: 23: Hoare triple {3887#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {3880#(or (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv4 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {3887#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {3887#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {3681#true} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {3887#(or (not (bvslt (bvadd main_~i~0 (_ bv5 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (bvslt (bvadd main_~i~0 (_ bv6 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (bvslt (bvadd main_~i~0 (_ bv3 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))))} is VALID [2018-11-23 11:08:49,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {3681#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {3681#true} is VALID [2018-11-23 11:08:49,396 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3681#true} {3681#true} #60#return; {3681#true} is VALID [2018-11-23 11:08:49,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:08:49,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {3681#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3681#true} is VALID [2018-11-23 11:08:49,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {3681#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3681#true} is VALID [2018-11-23 11:08:49,396 INFO L256 TraceCheckUtils]: 15: Hoare triple {3681#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {3681#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {3681#true} {3681#true} #58#return; {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {3681#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {3681#true} assume !(0bv8 != #t~nondet4);#t~ite5.base, #t~ite5.offset := ~#d2~0.base, ~#d2~0.offset; {3681#true} is VALID [2018-11-23 11:08:49,397 INFO L256 TraceCheckUtils]: 9: Hoare triple {3681#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {3681#true} is VALID [2018-11-23 11:08:49,398 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {3681#true} {3681#true} #56#return; {3681#true} is VALID [2018-11-23 11:08:49,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:08:49,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {3681#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {3681#true} is VALID [2018-11-23 11:08:49,398 INFO L256 TraceCheckUtils]: 5: Hoare triple {3681#true} call init(); {3681#true} is VALID [2018-11-23 11:08:49,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {3681#true} call #t~ret14 := main(); {3681#true} is VALID [2018-11-23 11:08:49,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3681#true} {3681#true} #52#return; {3681#true} is VALID [2018-11-23 11:08:49,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {3681#true} assume true; {3681#true} is VALID [2018-11-23 11:08:49,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {3681#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {3681#true} is VALID [2018-11-23 11:08:49,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {3681#true} call ULTIMATE.init(); {3681#true} is VALID [2018-11-23 11:08:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:08:49,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:49,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2018-11-23 11:08:49,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 42 [2018-11-23 11:08:49,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:49,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:08:49,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:49,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:08:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:08:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:08:49,976 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 27 states. [2018-11-23 11:08:51,871 WARN L180 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 29 [2018-11-23 11:08:52,530 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2018-11-23 11:08:53,288 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2018-11-23 11:08:53,839 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 27 [2018-11-23 11:08:54,365 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2018-11-23 11:08:54,802 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 24 [2018-11-23 11:08:55,242 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 20 [2018-11-23 11:08:55,603 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2018-11-23 11:08:56,082 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-23 11:09:01,171 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 11:09:02,650 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2018-11-23 11:09:03,273 WARN L180 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2018-11-23 11:09:04,024 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 11:09:04,658 WARN L180 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2018-11-23 11:09:05,210 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 11:09:05,656 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-23 11:09:06,243 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-11-23 11:09:06,681 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-23 11:09:06,995 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2018-11-23 11:09:07,513 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-23 11:09:07,801 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-11-23 11:09:09,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:09,136 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-23 11:09:09,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:09:09,136 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 42 [2018-11-23 11:09:09,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:09:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2018-11-23 11:09:09,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:09:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2018-11-23 11:09:09,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 102 transitions. [2018-11-23 11:09:11,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:11,676 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:09:11,676 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 11:09:11,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1067, Invalid=4045, Unknown=0, NotChecked=0, Total=5112 [2018-11-23 11:09:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 11:09:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2018-11-23 11:09:12,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:12,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 76 states. [2018-11-23 11:09:12,111 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 76 states. [2018-11-23 11:09:12,111 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 76 states. [2018-11-23 11:09:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:12,115 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 11:09:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-23 11:09:12,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:12,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:12,116 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 92 states. [2018-11-23 11:09:12,116 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 92 states. [2018-11-23 11:09:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:12,119 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-11-23 11:09:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-11-23 11:09:12,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:12,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:12,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:12,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 11:09:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-11-23 11:09:12,122 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 42 [2018-11-23 11:09:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:12,123 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-11-23 11:09:12,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:09:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-11-23 11:09:12,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:09:12,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:12,124 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:12,124 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:12,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:12,125 INFO L82 PathProgramCache]: Analyzing trace with hash -680736298, now seen corresponding path program 3 times [2018-11-23 11:09:12,125 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:12,125 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:09:12,148 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:09:12,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:09:12,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:09:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:12,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:12,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:09:12,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 11:09:12,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:12,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:13,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:13,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-11-23 11:09:13,031 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:13,031 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, v_main_~i~0_57]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (and (= main_~pa~0.offset .cse0) (bvslt v_main_~i~0_57 (_ bv10 32)) (= main_~pd2~0.base main_~pa~0.base) (= (store |v_#memory_int_47| main_~pd2~0.base (store (select |v_#memory_int_47| main_~pd2~0.base) .cse0 v_main_~i~0_57)) |#memory_int|) (= main_~pd2~0.offset (_ bv0 32)) (bvsge v_main_~i~0_57 (_ bv0 32)))) [2018-11-23 11:09:13,031 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_57]. (let ((.cse0 (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (and (= main_~pa~0.offset .cse0) (bvslt v_main_~i~0_57 (_ bv10 32)) (= main_~pd2~0.base main_~pa~0.base) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) .cse0)) (= main_~pd2~0.offset (_ bv0 32)) (bvsge v_main_~i~0_57 (_ bv0 32)))) [2018-11-23 11:09:14,992 INFO L256 TraceCheckUtils]: 0: Hoare triple {4488#true} call ULTIMATE.init(); {4488#true} is VALID [2018-11-23 11:09:14,992 INFO L273 TraceCheckUtils]: 1: Hoare triple {4488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,993 INFO L273 TraceCheckUtils]: 2: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,994 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4496#(= (_ bv0 32) |~#d1~0.offset|)} {4488#true} #52#return; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret14 := main(); {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,996 INFO L256 TraceCheckUtils]: 5: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} call init(); {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,998 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {4496#(= (_ bv0 32) |~#d1~0.offset|)} {4496#(= (_ bv0 32) |~#d1~0.offset|)} #56#return; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,999 INFO L256 TraceCheckUtils]: 9: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret7.base, #t~ret7.offset := get_dummy(); {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:14,999 INFO L273 TraceCheckUtils]: 10: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} assume true; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,001 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {4496#(= (_ bv0 32) |~#d1~0.offset|)} {4496#(= (_ bv0 32) |~#d1~0.offset|)} #58#return; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,002 INFO L273 TraceCheckUtils]: 14: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,002 INFO L256 TraceCheckUtils]: 15: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} call #t~ret8.base, #t~ret8.offset := get_dummy(); {4496#(= (_ bv0 32) |~#d1~0.offset|)} is VALID [2018-11-23 11:09:15,003 INFO L273 TraceCheckUtils]: 16: Hoare triple {4496#(= (_ bv0 32) |~#d1~0.offset|)} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {4542#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:09:15,004 INFO L273 TraceCheckUtils]: 17: Hoare triple {4542#(and (= |get_dummy_#t~ite5.offset| |~#d1~0.offset|) (= |~#d1~0.base| |get_dummy_#t~ite5.base|) (= (_ bv0 32) |~#d1~0.offset|))} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {4546#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:09:15,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {4546#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} assume true; {4546#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} is VALID [2018-11-23 11:09:15,005 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4546#(and (= |get_dummy_#res.base| |~#d1~0.base|) (= |get_dummy_#res.offset| |~#d1~0.offset|) (= (_ bv0 32) |~#d1~0.offset|))} {4496#(= (_ bv0 32) |~#d1~0.offset|)} #60#return; {4553#(= (_ bv0 32) |main_#t~ret8.offset|)} is VALID [2018-11-23 11:09:15,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {4553#(= (_ bv0 32) |main_#t~ret8.offset|)} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {4557#(= main_~pd2~0.offset (_ bv0 32))} is VALID [2018-11-23 11:09:15,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {4557#(= main_~pd2~0.offset (_ bv0 32))} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,022 INFO L273 TraceCheckUtils]: 35: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,023 INFO L273 TraceCheckUtils]: 36: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,027 INFO L273 TraceCheckUtils]: 38: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,028 INFO L273 TraceCheckUtils]: 39: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,028 INFO L273 TraceCheckUtils]: 40: Hoare triple {4561#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4619#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {4619#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= |main_#t~mem11| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4623#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,041 INFO L273 TraceCheckUtils]: 42: Hoare triple {4623#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (= (bvadd main_~pa~0.offset (_ bv4294967288 32)) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset)) (bvsge v_main_~i~0_57 (_ bv0 32)))) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pd2~0.base main_~pa~0.base) (= main_~pd2~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4627#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (= |main_#t~mem11| (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,046 INFO L273 TraceCheckUtils]: 43: Hoare triple {4627#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (= |main_#t~mem11| (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))))) (= main_~pd2~0.offset (_ bv0 32)))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {4631#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32))))) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:09:15,207 INFO L256 TraceCheckUtils]: 44: Hoare triple {4631#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32))))) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {4635#(exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))))} is VALID [2018-11-23 11:09:15,211 INFO L273 TraceCheckUtils]: 45: Hoare triple {4635#(exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))))} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {4639#(or (and (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32)))) (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:09:15,212 INFO L273 TraceCheckUtils]: 46: Hoare triple {4639#(or (and (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32)))) (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} assume true; {4639#(or (and (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32)))) (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:09:15,224 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4639#(or (and (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))) (= |check_#res| (_ bv0 32))) (and (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32)))) (exists ((v_main_~i~0_57 (_ BitVec 32)) (v_main_~i~0_BEFORE_CALL_1 (_ BitVec 32)) (v_main_~pd2~0.base_BEFORE_CALL_1 (_ BitVec 32))) (and (bvslt v_main_~i~0_57 (_ bv10 32)) (not (bvslt v_main_~i~0_BEFORE_CALL_1 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32))))) (= v_main_~i~0_57 (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))) (bvsge v_main_~i~0_57 (_ bv0 32)) (bvslt (bvadd v_main_~i~0_BEFORE_CALL_1 (_ bv4294967295 32)) (select (select |#memory_int| v_main_~pd2~0.base_BEFORE_CALL_1) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) (_ bv8 32)))))) (= (bvadd |check_#res| (_ bv4294967295 32)) (_ bv0 32))))} {4631#(and (exists ((v_main_~i~0_57 (_ BitVec 32))) (and (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (bvslt v_main_~i~0_57 (_ bv10 32)) (= v_main_~i~0_57 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32)))) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) v_main_~i~0_57) main_~pd2~0.offset (_ bv8 32))))) (bvsge v_main_~i~0_57 (_ bv0 32)))) (= main_~pd2~0.offset (_ bv0 32)))} #62#return; {4646#(= (_ bv1 32) |main_#t~ret13|)} is VALID [2018-11-23 11:09:15,225 INFO L273 TraceCheckUtils]: 48: Hoare triple {4646#(= (_ bv1 32) |main_#t~ret13|)} assume 0bv32 == #t~ret13;havoc #t~ret13; {4489#false} is VALID [2018-11-23 11:09:15,225 INFO L273 TraceCheckUtils]: 49: Hoare triple {4489#false} assume !false; {4489#false} is VALID [2018-11-23 11:09:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-23 11:09:15,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:09:22,841 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:09:22,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:22,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:22,843 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:74, output treesize:1 [2018-11-23 11:09:23,028 INFO L273 TraceCheckUtils]: 49: Hoare triple {4489#false} assume !false; {4489#false} is VALID [2018-11-23 11:09:23,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {4656#(not (= |main_#t~ret13| (_ bv0 32)))} assume 0bv32 == #t~ret13;havoc #t~ret13; {4489#false} is VALID [2018-11-23 11:09:23,061 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {4664#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))))} {4660#(= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32))))} #62#return; {4656#(not (= |main_#t~ret13| (_ bv0 32)))} is VALID [2018-11-23 11:09:23,077 INFO L273 TraceCheckUtils]: 46: Hoare triple {4664#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))))} assume true; {4664#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))))} is VALID [2018-11-23 11:09:23,091 INFO L273 TraceCheckUtils]: 45: Hoare triple {4488#true} ~s1.base, ~s1.offset := #in~s1.base, #in~s1.offset;~i := #in~i;call #t~mem6 := read~intINTTYPE4(~s1.base, ~bvadd32(~bvadd32(8bv32, ~s1.offset), ~bvmul32(4bv32, ~i)), 4bv32);#res := (if #t~mem6 == ~i then 1bv32 else 0bv32);havoc #t~mem6; {4664#(or (not (= |check_#res| (_ bv0 32))) (not (= |check_#in~i| (select (select |#memory_int| |check_#in~s1.base|) (bvadd |check_#in~s1.offset| (bvmul (_ bv4 32) |check_#in~i|) (_ bv8 32))))))} is VALID [2018-11-23 11:09:23,092 INFO L256 TraceCheckUtils]: 44: Hoare triple {4660#(= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32))))} call #t~ret13 := check(~pd2~0.base, ~pd2~0.offset, ~i~0); {4488#true} is VALID [2018-11-23 11:09:23,105 INFO L273 TraceCheckUtils]: 43: Hoare triple {4674#(or (bvslt main_~i~0 |main_#t~mem11|) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32)))))} assume !~bvslt32(~i~0, #t~mem11);havoc #t~mem11; {4660#(= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32))))} is VALID [2018-11-23 11:09:23,120 INFO L273 TraceCheckUtils]: 42: Hoare triple {4678#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4674#(or (bvslt main_~i~0 |main_#t~mem11|) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:09:23,526 INFO L273 TraceCheckUtils]: 41: Hoare triple {4682#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 |main_#t~mem11|))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4678#(or (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~i~0 (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv8 32)))))} is VALID [2018-11-23 11:09:23,527 INFO L273 TraceCheckUtils]: 40: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4682#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 |main_#t~mem11|))))} is VALID [2018-11-23 11:09:23,527 INFO L273 TraceCheckUtils]: 39: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,528 INFO L273 TraceCheckUtils]: 38: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,528 INFO L273 TraceCheckUtils]: 37: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,528 INFO L273 TraceCheckUtils]: 36: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,531 INFO L273 TraceCheckUtils]: 31: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,532 INFO L273 TraceCheckUtils]: 30: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,533 INFO L273 TraceCheckUtils]: 28: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,533 INFO L273 TraceCheckUtils]: 27: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,534 INFO L273 TraceCheckUtils]: 26: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,535 INFO L273 TraceCheckUtils]: 24: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} assume !!~bvslt32(~i~0, #t~mem11);havoc #t~mem11;#t~pre12 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre12; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,536 INFO L273 TraceCheckUtils]: 22: Hoare triple {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} call #t~mem11 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {4488#true} assume (((~pd1~0.base != 0bv32 || ~pd1~0.offset != 0bv32) && ~pd1~0.base == ~pd2~0.base && ~pd1~0.offset == ~pd2~0.offset) && ~bvsge32(~i~0, 0bv32)) && ~bvslt32(~i~0, 10bv32);call write~intINTTYPE4(~i~0, ~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~pa~0.base, ~pa~0.offset := ~pd1~0.base, ~bvadd32(~bvadd32(8bv32, ~pd1~0.offset), ~bvmul32(4bv32, ~i~0));call #t~mem10 := read~intINTTYPE4(~pd2~0.base, ~bvadd32(~bvadd32(8bv32, ~pd2~0.offset), ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvsub32(#t~mem10, 10bv32);havoc #t~mem10; {4686#(forall ((main_~i~0 (_ BitVec 32))) (or (bvslt (bvadd main_~i~0 (_ bv1 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= (bvadd (select (select |#memory_int| main_~pd2~0.base) (bvadd (bvmul (_ bv4 32) main_~i~0) main_~pd2~0.offset (_ bv12 32))) (_ bv4294967295 32)) main_~i~0) (not (bvslt main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))))} is VALID [2018-11-23 11:09:23,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {4488#true} ~pd2~0.base, ~pd2~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;~i~0 := #t~nondet9;havoc #t~nondet9; {4488#true} is VALID [2018-11-23 11:09:23,785 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4488#true} {4488#true} #60#return; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {4488#true} assume true; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {4488#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {4488#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L256 TraceCheckUtils]: 15: Hoare triple {4488#true} call #t~ret8.base, #t~ret8.offset := get_dummy(); {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {4488#true} ~pd1~0.base, ~pd1~0.offset := #t~ret7.base, #t~ret7.offset;havoc #t~ret7.base, #t~ret7.offset; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {4488#true} {4488#true} #58#return; {4488#true} is VALID [2018-11-23 11:09:23,786 INFO L273 TraceCheckUtils]: 12: Hoare triple {4488#true} assume true; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {4488#true} #res.base, #res.offset := #t~ite5.base, #t~ite5.offset;havoc #t~nondet4;havoc #t~ite5.base, #t~ite5.offset; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {4488#true} assume 0bv8 != #t~nondet4;#t~ite5.base, #t~ite5.offset := ~#d1~0.base, ~#d1~0.offset; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L256 TraceCheckUtils]: 9: Hoare triple {4488#true} call #t~ret7.base, #t~ret7.offset := get_dummy(); {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L268 TraceCheckUtils]: 8: Hoare quadruple {4488#true} {4488#true} #56#return; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {4488#true} assume true; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {4488#true} call write~intINTTYPE4(#t~nondet0, ~#d1~0.base, ~#d1~0.offset, 4bv32);havoc #t~nondet0;call write~intINTTYPE4(#t~nondet1, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#d2~0.base, ~#d2~0.offset, 4bv32);havoc #t~nondet2;call write~intINTTYPE4(#t~nondet3, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);havoc #t~nondet3; {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L256 TraceCheckUtils]: 5: Hoare triple {4488#true} call init(); {4488#true} is VALID [2018-11-23 11:09:23,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {4488#true} call #t~ret14 := main(); {4488#true} is VALID [2018-11-23 11:09:23,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4488#true} {4488#true} #52#return; {4488#true} is VALID [2018-11-23 11:09:23,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {4488#true} assume true; {4488#true} is VALID [2018-11-23 11:09:23,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {4488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#d1~0.base, ~#d1~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~#d1~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(4bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(8bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(12bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(16bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(20bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(24bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(28bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(32bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(36bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(40bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(44bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(48bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(52bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(56bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(60bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(64bv32, ~#d1~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d1~0.base, ~bvadd32(68bv32, ~#d1~0.offset), 4bv32);call ~#d2~0.base, ~#d2~0.offset := #Ultimate.alloc(72bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~#d2~0.offset, 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(4bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(8bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(12bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(16bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(20bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(24bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(28bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(32bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(36bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(40bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(44bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(48bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(52bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(56bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(60bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(64bv32, ~#d2~0.offset), 4bv32);call write~init~intINTTYPE4(0bv32, ~#d2~0.base, ~bvadd32(68bv32, ~#d2~0.offset), 4bv32); {4488#true} is VALID [2018-11-23 11:09:23,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {4488#true} call ULTIMATE.init(); {4488#true} is VALID [2018-11-23 11:09:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-23 11:09:23,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:09:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2018-11-23 11:09:23,802 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-11-23 11:09:23,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:23,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:09:24,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:24,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:09:24,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:09:24,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:09:24,983 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 22 states. [2018-11-23 11:09:29,124 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-23 11:09:42,839 WARN L180 SmtUtils]: Spent 10.78 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 11:09:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:44,423 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-11-23 11:09:44,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:09:44,423 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2018-11-23 11:09:44,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:09:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2018-11-23 11:09:44,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:09:44,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2018-11-23 11:09:44,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2018-11-23 11:09:45,722 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:45,723 INFO L225 Difference]: With dead ends: 89 [2018-11-23 11:09:45,723 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 11:09:45,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:09:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 11:09:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 11:09:45,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:45,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:45,725 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:45,725 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:45,725 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:09:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:45,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:45,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:45,726 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:45,726 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 11:09:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:45,726 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 11:09:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:45,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:45,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:45,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:45,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 11:09:45,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 11:09:45,727 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2018-11-23 11:09:45,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:45,727 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 11:09:45,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:09:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 11:09:45,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 11:09:45,916 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 89 [2018-11-23 11:09:46,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:09:46,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 11:09:46,315 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 271 [2018-11-23 11:09:46,483 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 11:09:47,124 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-23 11:09:48,429 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-23 11:09:49,279 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2018-11-23 11:09:50,649 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 1 [2018-11-23 11:09:52,326 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 106 DAG size of output: 66