/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/duplets.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:45:07,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:45:07,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:45:07,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:45:07,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:45:07,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:45:07,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:45:07,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:45:07,370 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:45:07,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:45:07,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:45:07,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:45:07,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:45:07,378 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:45:07,379 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:45:07,381 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:45:07,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:45:07,382 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:45:07,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:45:07,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:45:07,390 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:45:07,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:45:07,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:45:07,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:45:07,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:45:07,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:45:07,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:45:07,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:45:07,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:45:07,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:45:07,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:45:07,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:45:07,403 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:45:07,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:45:07,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:45:07,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:45:07,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:45:07,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:45:07,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:45:07,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:45:07,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:45:07,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:45:07,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 11:45:07,435 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:45:07,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:45:07,436 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:45:07,436 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:45:07,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:45:07,437 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:45:07,437 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:45:07,437 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:45:07,437 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:45:07,438 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:45:07,438 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:45:07,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:45:07,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:45:07,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:45:07,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:45:07,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:07,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:45:07,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:45:07,441 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:45:07,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:45:07,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:45:07,441 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 11:45:07,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:45:07,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:45:07,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:45:07,654 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:45:07,655 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:45:07,656 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/duplets.c [2022-04-27 11:45:07,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e699f0e/4925aca7dbb142458b233a27a0c1e794/FLAG6c171b933 [2022-04-27 11:45:08,083 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:45:08,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c [2022-04-27 11:45:08,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e699f0e/4925aca7dbb142458b233a27a0c1e794/FLAG6c171b933 [2022-04-27 11:45:08,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e699f0e/4925aca7dbb142458b233a27a0c1e794 [2022-04-27 11:45:08,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:45:08,100 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:45:08,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:08,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:45:08,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:45:08,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f91f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08, skipping insertion in model container [2022-04-27 11:45:08,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:45:08,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:45:08,249 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-04-27 11:45:08,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:08,293 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:45:08,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/duplets.c[485,498] [2022-04-27 11:45:08,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:45:08,325 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:45:08,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08 WrapperNode [2022-04-27 11:45:08,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:45:08,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:45:08,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:45:08,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:45:08,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:45:08,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:45:08,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:45:08,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:45:08,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (1/1) ... [2022-04-27 11:45:08,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:45:08,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:08,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 11:45:08,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 11:45:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:45:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:45:08,430 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure mkdup [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure finddup [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:45:08,431 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-27 11:45:08,431 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure free [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:45:08,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure mkdup [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure finddup [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-27 11:45:08,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:45:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:45:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:45:08,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:45:08,511 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:45:08,512 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:45:08,768 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:45:08,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:45:08,775 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:45:08,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:08 BoogieIcfgContainer [2022-04-27 11:45:08,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:45:08,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:45:08,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:45:08,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:45:08,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:45:08" (1/3) ... [2022-04-27 11:45:08,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f887e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:08, skipping insertion in model container [2022-04-27 11:45:08,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:45:08" (2/3) ... [2022-04-27 11:45:08,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f887e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:45:08, skipping insertion in model container [2022-04-27 11:45:08,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:45:08" (3/3) ... [2022-04-27 11:45:08,787 INFO L111 eAbstractionObserver]: Analyzing ICFG duplets.c [2022-04-27 11:45:08,804 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:45:08,806 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:45:08,864 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:45:08,869 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5e57be26, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2301acd1 [2022-04-27 11:45:08,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:45:08,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-27 11:45:08,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 11:45:08,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:08,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:08,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1531213237, now seen corresponding path program 1 times [2022-04-27 11:45:08,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:08,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071445465] [2022-04-27 11:45:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62#true} is VALID [2022-04-27 11:45:09,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62#true} {62#true} #122#return; {62#true} is VALID [2022-04-27 11:45:09,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#false} {62#true} #98#return; {63#false} is VALID [2022-04-27 11:45:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {62#true} is VALID [2022-04-27 11:45:09,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,115 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62#true} {63#false} #100#return; {63#false} is VALID [2022-04-27 11:45:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#false} {62#true} #116#return; {63#false} is VALID [2022-04-27 11:45:09,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#false} {63#false} #118#return; {63#false} is VALID [2022-04-27 11:45:09,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#false} {63#false} #120#return; {63#false} is VALID [2022-04-27 11:45:09,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {62#true} is VALID [2022-04-27 11:45:09,183 INFO L272 TraceCheckUtils]: 1: Hoare triple {62#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,184 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {63#false} {62#true} #116#return; {63#false} is VALID [2022-04-27 11:45:09,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {63#false} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63#false} {63#false} #118#return; {63#false} is VALID [2022-04-27 11:45:09,186 INFO L272 TraceCheckUtils]: 11: Hoare triple {63#false} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,187 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {63#false} {63#false} #120#return; {63#false} is VALID [2022-04-27 11:45:09,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {63#false} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {63#false} is VALID [2022-04-27 11:45:09,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,188 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {63#false} {63#false} #102#return; {63#false} is VALID [2022-04-27 11:45:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:09,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {62#true} is VALID [2022-04-27 11:45:09,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {62#true} assume !(~i~1 < ~n); {62#true} is VALID [2022-04-27 11:45:09,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} #res := 0; {62#true} is VALID [2022-04-27 11:45:09,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,224 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {62#true} {63#false} #104#return; {63#false} is VALID [2022-04-27 11:45:09,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {62#true} call ULTIMATE.init(); {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:09,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {62#true} is VALID [2022-04-27 11:45:09,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62#true} {62#true} #122#return; {62#true} is VALID [2022-04-27 11:45:09,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {62#true} call #t~ret27 := main(); {62#true} is VALID [2022-04-27 11:45:09,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {62#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {62#true} is VALID [2022-04-27 11:45:09,226 INFO L272 TraceCheckUtils]: 6: Hoare triple {62#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,228 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63#false} {62#true} #98#return; {63#false} is VALID [2022-04-27 11:45:09,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {63#false} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {63#false} is VALID [2022-04-27 11:45:09,228 INFO L272 TraceCheckUtils]: 12: Hoare triple {63#false} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {99#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:09,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {62#true} is VALID [2022-04-27 11:45:09,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,229 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {62#true} {63#false} #100#return; {63#false} is VALID [2022-04-27 11:45:09,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {63#false} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {63#false} is VALID [2022-04-27 11:45:09,229 INFO L272 TraceCheckUtils]: 17: Hoare triple {63#false} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {99#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:09,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {62#true} is VALID [2022-04-27 11:45:09,229 INFO L272 TraceCheckUtils]: 19: Hoare triple {62#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,231 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {63#false} {62#true} #116#return; {63#false} is VALID [2022-04-27 11:45:09,232 INFO L272 TraceCheckUtils]: 24: Hoare triple {63#false} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,233 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {63#false} {63#false} #118#return; {63#false} is VALID [2022-04-27 11:45:09,233 INFO L272 TraceCheckUtils]: 29: Hoare triple {63#false} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {62#true} is VALID [2022-04-27 11:45:09,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {62#true} ~cond := #in~cond; {62#true} is VALID [2022-04-27 11:45:09,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {62#true} assume 0 == ~cond;assume false; {63#false} is VALID [2022-04-27 11:45:09,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,236 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {63#false} {63#false} #120#return; {63#false} is VALID [2022-04-27 11:45:09,237 INFO L290 TraceCheckUtils]: 34: Hoare triple {63#false} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {63#false} is VALID [2022-04-27 11:45:09,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {63#false} assume true; {63#false} is VALID [2022-04-27 11:45:09,237 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {63#false} {63#false} #102#return; {63#false} is VALID [2022-04-27 11:45:09,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {63#false} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {63#false} is VALID [2022-04-27 11:45:09,237 INFO L272 TraceCheckUtils]: 38: Hoare triple {63#false} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {99#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:09,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {99#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {62#true} is VALID [2022-04-27 11:45:09,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {62#true} assume !(~i~1 < ~n); {62#true} is VALID [2022-04-27 11:45:09,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {62#true} #res := 0; {62#true} is VALID [2022-04-27 11:45:09,238 INFO L290 TraceCheckUtils]: 42: Hoare triple {62#true} assume true; {62#true} is VALID [2022-04-27 11:45:09,238 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {62#true} {63#false} #104#return; {63#false} is VALID [2022-04-27 11:45:09,238 INFO L290 TraceCheckUtils]: 44: Hoare triple {63#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {63#false} is VALID [2022-04-27 11:45:09,239 INFO L272 TraceCheckUtils]: 45: Hoare triple {63#false} call __VERIFIER_assert(~r~0); {63#false} is VALID [2022-04-27 11:45:09,239 INFO L290 TraceCheckUtils]: 46: Hoare triple {63#false} ~cond := #in~cond; {63#false} is VALID [2022-04-27 11:45:09,239 INFO L290 TraceCheckUtils]: 47: Hoare triple {63#false} assume 0 == ~cond; {63#false} is VALID [2022-04-27 11:45:09,239 INFO L290 TraceCheckUtils]: 48: Hoare triple {63#false} assume !false; {63#false} is VALID [2022-04-27 11:45:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:09,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071445465] [2022-04-27 11:45:09,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071445465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:09,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:09,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 11:45:09,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173716746] [2022-04-27 11:45:09,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-27 11:45:09,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:09,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:09,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:09,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 11:45:09,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 11:45:09,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 11:45:09,358 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:09,726 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-27 11:45:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:45:09,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2022-04-27 11:45:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:09,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-04-27 11:45:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2022-04-27 11:45:09,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 153 transitions. [2022-04-27 11:45:09,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:09,944 INFO L225 Difference]: With dead ends: 113 [2022-04-27 11:45:09,944 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 11:45:09,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:45:09,952 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 59 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:09,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 55 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:45:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 11:45:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2022-04-27 11:45:09,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:09,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:09,987 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:09,988 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:09,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:09,996 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-27 11:45:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-27 11:45:09,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:09,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:09,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 56 states. [2022-04-27 11:45:10,000 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 56 states. [2022-04-27 11:45:10,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:10,008 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-04-27 11:45:10,008 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-04-27 11:45:10,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:10,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:10,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:10,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:10,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-27 11:45:10,023 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 49 [2022-04-27 11:45:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:10,023 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-27 11:45:10,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-27 11:45:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-27 11:45:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 11:45:10,025 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:10,025 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:10,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:45:10,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:10,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1121655349, now seen corresponding path program 1 times [2022-04-27 11:45:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:10,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759033002] [2022-04-27 11:45:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:10,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:10,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:45:10,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #122#return; {460#true} is VALID [2022-04-27 11:45:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #98#return; {460#true} is VALID [2022-04-27 11:45:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {460#true} is VALID [2022-04-27 11:45:10,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {460#true} {460#true} #100#return; {460#true} is VALID [2022-04-27 11:45:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:10,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#(not (= |assume_abort_if_not_#in~cond| 0))} {499#(= |mkdup_#in~n| mkdup_~n)} #116#return; {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} is VALID [2022-04-27 11:45:10,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} #118#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {509#(<= 1 |mkdup_#in~n|)} #120#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {499#(= |mkdup_#in~n| mkdup_~n)} is VALID [2022-04-27 11:45:10,266 INFO L272 TraceCheckUtils]: 1: Hoare triple {499#(= |mkdup_#in~n| mkdup_~n)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} ~cond := #in~cond; {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:10,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {515#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,269 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {515#(not (= |assume_abort_if_not_#in~cond| 0))} {499#(= |mkdup_#in~n| mkdup_~n)} #116#return; {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} is VALID [2022-04-27 11:45:10,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {460#true} {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} #118#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,270 INFO L272 TraceCheckUtils]: 11: Hoare triple {509#(<= 1 |mkdup_#in~n|)} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,272 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {460#true} {509#(<= 1 |mkdup_#in~n|)} #120#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,272 INFO L290 TraceCheckUtils]: 17: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume true; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,273 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {509#(<= 1 |mkdup_#in~n|)} {460#true} #102#return; {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:10,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {516#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} is VALID [2022-04-27 11:45:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} assume !(~i~1 < ~n); {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#(<= |finddup_#in~n| 0)} #res := 0; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(<= |finddup_#in~n| 0)} assume true; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,313 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {517#(<= |finddup_#in~n| 0)} {491#(<= 1 main_~n~0)} #104#return; {461#false} is VALID [2022-04-27 11:45:10,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:10,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:45:10,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #122#return; {460#true} is VALID [2022-04-27 11:45:10,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret27 := main(); {460#true} is VALID [2022-04-27 11:45:10,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {460#true} is VALID [2022-04-27 11:45:10,315 INFO L272 TraceCheckUtils]: 6: Hoare triple {460#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {460#true} {460#true} #98#return; {460#true} is VALID [2022-04-27 11:45:10,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {460#true} is VALID [2022-04-27 11:45:10,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:10,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {460#true} is VALID [2022-04-27 11:45:10,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {460#true} {460#true} #100#return; {460#true} is VALID [2022-04-27 11:45:10,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {460#true} is VALID [2022-04-27 11:45:10,318 INFO L272 TraceCheckUtils]: 17: Hoare triple {460#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:10,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {499#(= |mkdup_#in~n| mkdup_~n)} is VALID [2022-04-27 11:45:10,319 INFO L272 TraceCheckUtils]: 19: Hoare triple {499#(= |mkdup_#in~n| mkdup_~n)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#true} ~cond := #in~cond; {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:10,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {515#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,321 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {515#(not (= |assume_abort_if_not_#in~cond| 0))} {499#(= |mkdup_#in~n| mkdup_~n)} #116#return; {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} is VALID [2022-04-27 11:45:10,321 INFO L272 TraceCheckUtils]: 24: Hoare triple {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,322 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {460#true} {504#(and (<= 1 mkdup_~n) (= |mkdup_#in~n| mkdup_~n))} #118#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,322 INFO L272 TraceCheckUtils]: 29: Hoare triple {509#(<= 1 |mkdup_#in~n|)} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,323 INFO L290 TraceCheckUtils]: 32: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,324 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {460#true} {509#(<= 1 |mkdup_#in~n|)} #120#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume true; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,325 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {509#(<= 1 |mkdup_#in~n|)} {460#true} #102#return; {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:10,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {491#(<= 1 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:10,327 INFO L272 TraceCheckUtils]: 38: Hoare triple {491#(<= 1 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {498#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:10,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {498#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {516#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} is VALID [2022-04-27 11:45:10,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {516#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} assume !(~i~1 < ~n); {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {517#(<= |finddup_#in~n| 0)} #res := 0; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {517#(<= |finddup_#in~n| 0)} assume true; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,331 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {517#(<= |finddup_#in~n| 0)} {491#(<= 1 main_~n~0)} #104#return; {461#false} is VALID [2022-04-27 11:45:10,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {461#false} is VALID [2022-04-27 11:45:10,331 INFO L272 TraceCheckUtils]: 45: Hoare triple {461#false} call __VERIFIER_assert(~r~0); {461#false} is VALID [2022-04-27 11:45:10,331 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:45:10,331 INFO L290 TraceCheckUtils]: 47: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:45:10,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:45:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:10,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:10,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759033002] [2022-04-27 11:45:10,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759033002] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:10,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979455496] [2022-04-27 11:45:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:10,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:10,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:10,335 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:10,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 11:45:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:45:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:10,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:10,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2022-04-27 11:45:10,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:45:10,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #122#return; {460#true} is VALID [2022-04-27 11:45:10,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret27 := main(); {460#true} is VALID [2022-04-27 11:45:10,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {460#true} is VALID [2022-04-27 11:45:10,856 INFO L272 TraceCheckUtils]: 6: Hoare triple {460#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,857 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {460#true} {460#true} #98#return; {460#true} is VALID [2022-04-27 11:45:10,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {460#true} is VALID [2022-04-27 11:45:10,857 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {460#true} is VALID [2022-04-27 11:45:10,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {460#true} is VALID [2022-04-27 11:45:10,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {460#true} {460#true} #100#return; {460#true} is VALID [2022-04-27 11:45:10,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {460#true} is VALID [2022-04-27 11:45:10,864 INFO L272 TraceCheckUtils]: 17: Hoare triple {460#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {460#true} is VALID [2022-04-27 11:45:10,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {575#(<= mkdup_~n |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,865 INFO L272 TraceCheckUtils]: 19: Hoare triple {575#(<= mkdup_~n |mkdup_#in~n|)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,866 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {460#true} {575#(<= mkdup_~n |mkdup_#in~n|)} #116#return; {575#(<= mkdup_~n |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,866 INFO L272 TraceCheckUtils]: 24: Hoare triple {575#(<= mkdup_~n |mkdup_#in~n|)} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {460#true} ~cond := #in~cond; {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:10,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {514#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:10,868 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {515#(not (= |assume_abort_if_not_#in~cond| 0))} {575#(<= mkdup_~n |mkdup_#in~n|)} #118#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,869 INFO L272 TraceCheckUtils]: 29: Hoare triple {509#(<= 1 |mkdup_#in~n|)} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:10,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:10,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:10,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:10,870 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {460#true} {509#(<= 1 |mkdup_#in~n|)} #120#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume true; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:10,871 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {509#(<= 1 |mkdup_#in~n|)} {460#true} #102#return; {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:10,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {491#(<= 1 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:10,872 INFO L272 TraceCheckUtils]: 38: Hoare triple {491#(<= 1 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {460#true} is VALID [2022-04-27 11:45:10,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {460#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {639#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0))} is VALID [2022-04-27 11:45:10,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {639#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0))} assume !(~i~1 < ~n); {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {517#(<= |finddup_#in~n| 0)} #res := 0; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {517#(<= |finddup_#in~n| 0)} assume true; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:10,875 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {517#(<= |finddup_#in~n| 0)} {491#(<= 1 main_~n~0)} #104#return; {461#false} is VALID [2022-04-27 11:45:10,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {461#false} is VALID [2022-04-27 11:45:10,876 INFO L272 TraceCheckUtils]: 45: Hoare triple {461#false} call __VERIFIER_assert(~r~0); {461#false} is VALID [2022-04-27 11:45:10,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:45:10,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:45:10,876 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:45:10,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:10,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:11,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {461#false} assume !false; {461#false} is VALID [2022-04-27 11:45:11,745 INFO L290 TraceCheckUtils]: 47: Hoare triple {461#false} assume 0 == ~cond; {461#false} is VALID [2022-04-27 11:45:11,745 INFO L290 TraceCheckUtils]: 46: Hoare triple {461#false} ~cond := #in~cond; {461#false} is VALID [2022-04-27 11:45:11,745 INFO L272 TraceCheckUtils]: 45: Hoare triple {461#false} call __VERIFIER_assert(~r~0); {461#false} is VALID [2022-04-27 11:45:11,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {461#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {461#false} is VALID [2022-04-27 11:45:11,753 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {517#(<= |finddup_#in~n| 0)} {491#(<= 1 main_~n~0)} #104#return; {461#false} is VALID [2022-04-27 11:45:11,753 INFO L290 TraceCheckUtils]: 42: Hoare triple {517#(<= |finddup_#in~n| 0)} assume true; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:11,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {517#(<= |finddup_#in~n| 0)} #res := 0; {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:11,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {694#(or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))} assume !(~i~1 < ~n); {517#(<= |finddup_#in~n| 0)} is VALID [2022-04-27 11:45:11,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {460#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {694#(or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))} is VALID [2022-04-27 11:45:11,756 INFO L272 TraceCheckUtils]: 38: Hoare triple {491#(<= 1 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {460#true} is VALID [2022-04-27 11:45:11,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {491#(<= 1 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:11,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {509#(<= 1 |mkdup_#in~n|)} {460#true} #102#return; {491#(<= 1 main_~n~0)} is VALID [2022-04-27 11:45:11,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume true; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:11,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {509#(<= 1 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:11,762 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {460#true} {509#(<= 1 |mkdup_#in~n|)} #120#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:11,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:11,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:11,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:11,765 INFO L272 TraceCheckUtils]: 29: Hoare triple {509#(<= 1 |mkdup_#in~n|)} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:11,767 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {515#(not (= |assume_abort_if_not_#in~cond| 0))} {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} #118#return; {509#(<= 1 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:11,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:11,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {741#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {515#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:11,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {460#true} ~cond := #in~cond; {741#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:45:11,769 INFO L272 TraceCheckUtils]: 24: Hoare triple {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:11,769 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {460#true} {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} #116#return; {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:11,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:11,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:11,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:11,770 INFO L272 TraceCheckUtils]: 19: Hoare triple {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:11,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {460#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {731#(or (<= mkdup_~n 0) (<= 1 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:11,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {460#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {460#true} is VALID [2022-04-27 11:45:11,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {460#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {460#true} is VALID [2022-04-27 11:45:11,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {460#true} {460#true} #100#return; {460#true} is VALID [2022-04-27 11:45:11,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:11,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {460#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {460#true} is VALID [2022-04-27 11:45:11,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {460#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {460#true} is VALID [2022-04-27 11:45:11,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {460#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {460#true} is VALID [2022-04-27 11:45:11,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {460#true} {460#true} #98#return; {460#true} is VALID [2022-04-27 11:45:11,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:11,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {460#true} assume !(0 == ~cond); {460#true} is VALID [2022-04-27 11:45:11,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {460#true} ~cond := #in~cond; {460#true} is VALID [2022-04-27 11:45:11,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {460#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {460#true} is VALID [2022-04-27 11:45:11,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {460#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {460#true} is VALID [2022-04-27 11:45:11,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {460#true} call #t~ret27 := main(); {460#true} is VALID [2022-04-27 11:45:11,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {460#true} {460#true} #122#return; {460#true} is VALID [2022-04-27 11:45:11,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {460#true} assume true; {460#true} is VALID [2022-04-27 11:45:11,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {460#true} is VALID [2022-04-27 11:45:11,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {460#true} call ULTIMATE.init(); {460#true} is VALID [2022-04-27 11:45:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:11,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979455496] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:11,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:45:11,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 17 [2022-04-27 11:45:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396910323] [2022-04-27 11:45:11,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:11,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 49 [2022-04-27 11:45:11,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:11,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-04-27 11:45:11,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:11,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 11:45:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 11:45:11,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:45:11,835 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-04-27 11:45:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:13,497 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2022-04-27 11:45:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-27 11:45:13,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 49 [2022-04-27 11:45:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-04-27 11:45:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2022-04-27 11:45:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-04-27 11:45:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 103 transitions. [2022-04-27 11:45:13,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 103 transitions. [2022-04-27 11:45:13,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:13,619 INFO L225 Difference]: With dead ends: 84 [2022-04-27 11:45:13,619 INFO L226 Difference]: Without dead ends: 63 [2022-04-27 11:45:13,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2022-04-27 11:45:13,621 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 107 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:13,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:45:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-27 11:45:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-04-27 11:45:13,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:13,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:13,634 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:13,635 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:13,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:13,638 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 11:45:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 11:45:13,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:13,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:13,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 11:45:13,640 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-27 11:45:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:13,646 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-27 11:45:13,646 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-27 11:45:13,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:13,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:13,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:13,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 14 states have call successors, (14), 7 states have call predecessors, (14), 6 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:45:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2022-04-27 11:45:13,649 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 49 [2022-04-27 11:45:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:13,650 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2022-04-27 11:45:13,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 14 states have internal predecessors, (35), 8 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2022-04-27 11:45:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2022-04-27 11:45:13,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 11:45:13,651 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:13,651 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:13,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 11:45:13,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:13,872 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:13,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:13,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2096379008, now seen corresponding path program 1 times [2022-04-27 11:45:13,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:13,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149506728] [2022-04-27 11:45:13,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-27 11:45:13,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:13,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #122#return; {1161#true} is VALID [2022-04-27 11:45:13,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:13,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:13,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:13,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #98#return; {1161#true} is VALID [2022-04-27 11:45:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1161#true} is VALID [2022-04-27 11:45:13,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:13,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1161#true} {1161#true} #100#return; {1161#true} is VALID [2022-04-27 11:45:13,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:13,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:13,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:13,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:13,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #116#return; {1161#true} is VALID [2022-04-27 11:45:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:14,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,006 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #118#return; {1161#true} is VALID [2022-04-27 11:45:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:14,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #120#return; {1161#true} is VALID [2022-04-27 11:45:14,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1161#true} is VALID [2022-04-27 11:45:14,010 INFO L272 TraceCheckUtils]: 1: Hoare triple {1161#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1161#true} {1161#true} #116#return; {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L272 TraceCheckUtils]: 6: Hoare triple {1161#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1161#true} {1161#true} #118#return; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L272 TraceCheckUtils]: 11: Hoare triple {1161#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1161#true} {1161#true} #120#return; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {1161#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,012 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1161#true} {1161#true} #102#return; {1161#true} is VALID [2022-04-27 11:45:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:14,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1161#true} is VALID [2022-04-27 11:45:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1161#true} is VALID [2022-04-27 11:45:14,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {1161#true} is VALID [2022-04-27 11:45:14,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {1161#true} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} is VALID [2022-04-27 11:45:14,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} assume true; {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} is VALID [2022-04-27 11:45:14,041 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} {1161#true} #104#return; {1198#(= |main_#t~ret14| 1)} is VALID [2022-04-27 11:45:14,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {1161#true} call ULTIMATE.init(); {1202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1161#true} {1161#true} #122#return; {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {1161#true} call #t~ret27 := main(); {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1161#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L272 TraceCheckUtils]: 6: Hoare triple {1161#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,043 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1161#true} {1161#true} #98#return; {1161#true} is VALID [2022-04-27 11:45:14,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {1161#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1161#true} is VALID [2022-04-27 11:45:14,043 INFO L272 TraceCheckUtils]: 12: Hoare triple {1161#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {1203#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:14,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1161#true} is VALID [2022-04-27 11:45:14,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,044 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1161#true} {1161#true} #100#return; {1161#true} is VALID [2022-04-27 11:45:14,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1161#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L272 TraceCheckUtils]: 17: Hoare triple {1161#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {1203#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:14,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {1161#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1161#true} {1161#true} #116#return; {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L272 TraceCheckUtils]: 24: Hoare triple {1161#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1161#true} {1161#true} #118#return; {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L272 TraceCheckUtils]: 29: Hoare triple {1161#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {1161#true} ~cond := #in~cond; {1161#true} is VALID [2022-04-27 11:45:14,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {1161#true} assume !(0 == ~cond); {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1161#true} {1161#true} #120#return; {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {1161#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {1161#true} assume true; {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1161#true} {1161#true} #102#return; {1161#true} is VALID [2022-04-27 11:45:14,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {1161#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {1161#true} is VALID [2022-04-27 11:45:14,048 INFO L272 TraceCheckUtils]: 38: Hoare triple {1161#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {1203#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:14,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {1203#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1161#true} is VALID [2022-04-27 11:45:14,049 INFO L290 TraceCheckUtils]: 40: Hoare triple {1161#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1161#true} is VALID [2022-04-27 11:45:14,049 INFO L290 TraceCheckUtils]: 41: Hoare triple {1161#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {1161#true} is VALID [2022-04-27 11:45:14,049 INFO L290 TraceCheckUtils]: 42: Hoare triple {1161#true} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} is VALID [2022-04-27 11:45:14,049 INFO L290 TraceCheckUtils]: 43: Hoare triple {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} assume true; {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} is VALID [2022-04-27 11:45:14,051 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {1216#(and (<= 1 |finddup_#res|) (<= |finddup_#res| 1))} {1161#true} #104#return; {1198#(= |main_#t~ret14| 1)} is VALID [2022-04-27 11:45:14,051 INFO L290 TraceCheckUtils]: 45: Hoare triple {1198#(= |main_#t~ret14| 1)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {1199#(= main_~r~0 1)} is VALID [2022-04-27 11:45:14,052 INFO L272 TraceCheckUtils]: 46: Hoare triple {1199#(= main_~r~0 1)} call __VERIFIER_assert(~r~0); {1200#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 11:45:14,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {1200#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1201#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 11:45:14,052 INFO L290 TraceCheckUtils]: 48: Hoare triple {1201#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1162#false} is VALID [2022-04-27 11:45:14,053 INFO L290 TraceCheckUtils]: 49: Hoare triple {1162#false} assume !false; {1162#false} is VALID [2022-04-27 11:45:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:14,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149506728] [2022-04-27 11:45:14,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149506728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:14,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:14,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 11:45:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459903006] [2022-04-27 11:45:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:14,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2022-04-27 11:45:14,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:14,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:14,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:14,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:45:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:14,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:45:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:45:14,086 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:15,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:15,015 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-27 11:45:15,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:45:15,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 50 [2022-04-27 11:45:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:15,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-27 11:45:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:15,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 90 transitions. [2022-04-27 11:45:15,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 90 transitions. [2022-04-27 11:45:15,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:15,102 INFO L225 Difference]: With dead ends: 75 [2022-04-27 11:45:15,102 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 11:45:15,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:45:15,104 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 83 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:15,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 59 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 11:45:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 11:45:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 63. [2022-04-27 11:45:15,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:15,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:15,127 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:15,128 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:15,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:15,136 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 11:45:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 11:45:15,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:15,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:15,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 73 states. [2022-04-27 11:45:15,141 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 73 states. [2022-04-27 11:45:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:15,148 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-27 11:45:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-27 11:45:15,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:15,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:15,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:15,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 41 states have internal predecessors, (45), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-04-27 11:45:15,152 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 50 [2022-04-27 11:45:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:15,154 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-04-27 11:45:15,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-04-27 11:45:15,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 11:45:15,157 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:15,157 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:15,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:45:15,158 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 983031743, now seen corresponding path program 1 times [2022-04-27 11:45:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:15,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612804422] [2022-04-27 11:45:15,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:15,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1572#true} is VALID [2022-04-27 11:45:15,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1572#true} {1572#true} #122#return; {1572#true} is VALID [2022-04-27 11:45:15,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#true} ~cond := #in~cond; {1572#true} is VALID [2022-04-27 11:45:15,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} assume !(0 == ~cond); {1572#true} is VALID [2022-04-27 11:45:15,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#true} {1572#true} #98#return; {1572#true} is VALID [2022-04-27 11:45:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1572#true} is VALID [2022-04-27 11:45:15,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1572#true} {1572#true} #100#return; {1572#true} is VALID [2022-04-27 11:45:15,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1614#(= |mkdup_#in~n| mkdup_~n)} #116#return; {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} is VALID [2022-04-27 11:45:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} #118#return; {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} #120#return; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1614#(= |mkdup_#in~n| mkdup_~n)} is VALID [2022-04-27 11:45:15,492 INFO L272 TraceCheckUtils]: 1: Hoare triple {1614#(= |mkdup_#in~n| mkdup_~n)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,494 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1614#(= |mkdup_#in~n| mkdup_~n)} #116#return; {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} is VALID [2022-04-27 11:45:15,494 INFO L272 TraceCheckUtils]: 6: Hoare triple {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,496 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} #118#return; {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:15,496 INFO L272 TraceCheckUtils]: 11: Hoare triple {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,498 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} #120#return; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume true; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,499 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1629#(<= 2 |mkdup_#in~n|)} {1572#true} #102#return; {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1632#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} is VALID [2022-04-27 11:45:15,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1632#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1633#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:15,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {1633#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} assume !(~j~1 < ~n); {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} is VALID [2022-04-27 11:45:15,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} is VALID [2022-04-27 11:45:15,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} assume !(~i~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {1635#(<= |finddup_#in~n| 1)} #res := 0; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume true; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1635#(<= |finddup_#in~n| 1)} {1603#(<= 2 main_~n~0)} #104#return; {1573#false} is VALID [2022-04-27 11:45:15,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {1572#true} call ULTIMATE.init(); {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {1612#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#true} {1572#true} #122#return; {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1572#true} call #t~ret27 := main(); {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L272 TraceCheckUtils]: 6: Hoare triple {1572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} ~cond := #in~cond; {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} assume !(0 == ~cond); {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,567 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1572#true} {1572#true} #98#return; {1572#true} is VALID [2022-04-27 11:45:15,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1572#true} is VALID [2022-04-27 11:45:15,568 INFO L272 TraceCheckUtils]: 12: Hoare triple {1572#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {1613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:15,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1572#true} is VALID [2022-04-27 11:45:15,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:15,568 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1572#true} {1572#true} #100#return; {1572#true} is VALID [2022-04-27 11:45:15,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {1572#true} is VALID [2022-04-27 11:45:15,569 INFO L272 TraceCheckUtils]: 17: Hoare triple {1572#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {1613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:15,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1614#(= |mkdup_#in~n| mkdup_~n)} is VALID [2022-04-27 11:45:15,569 INFO L272 TraceCheckUtils]: 19: Hoare triple {1614#(= |mkdup_#in~n| mkdup_~n)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,571 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1614#(= |mkdup_#in~n| mkdup_~n)} #116#return; {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} is VALID [2022-04-27 11:45:15,571 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,573 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1619#(and (= |mkdup_#in~n| mkdup_~n) (or (and (not (<= (+ mkdup_~j~0 1) mkdup_~i~0)) (<= 0 mkdup_~i~0)) (not (= mkdup_~j~0 0)) (<= 2 mkdup_~n)))} #118#return; {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:15,573 INFO L272 TraceCheckUtils]: 29: Hoare triple {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:15,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:15,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:15,575 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} #120#return; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume true; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:15,577 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1629#(<= 2 |mkdup_#in~n|)} {1572#true} #102#return; {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:15,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {1603#(<= 2 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:15,578 INFO L272 TraceCheckUtils]: 38: Hoare triple {1603#(<= 2 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {1613#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:15,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {1613#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1632#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} is VALID [2022-04-27 11:45:15,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {1632#(and (<= finddup_~i~1 0) (= |finddup_#in~n| finddup_~n))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1633#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:15,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {1633#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} assume !(~j~1 < ~n); {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} is VALID [2022-04-27 11:45:15,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} is VALID [2022-04-27 11:45:15,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {1634#(and (= |finddup_#in~n| finddup_~n) (<= finddup_~n 1))} assume !(~i~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {1635#(<= |finddup_#in~n| 1)} #res := 0; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume true; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:15,583 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1635#(<= |finddup_#in~n| 1)} {1603#(<= 2 main_~n~0)} #104#return; {1573#false} is VALID [2022-04-27 11:45:15,583 INFO L290 TraceCheckUtils]: 47: Hoare triple {1573#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {1573#false} is VALID [2022-04-27 11:45:15,583 INFO L272 TraceCheckUtils]: 48: Hoare triple {1573#false} call __VERIFIER_assert(~r~0); {1573#false} is VALID [2022-04-27 11:45:15,583 INFO L290 TraceCheckUtils]: 49: Hoare triple {1573#false} ~cond := #in~cond; {1573#false} is VALID [2022-04-27 11:45:15,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {1573#false} assume 0 == ~cond; {1573#false} is VALID [2022-04-27 11:45:15,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2022-04-27 11:45:15,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:15,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:15,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612804422] [2022-04-27 11:45:15,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612804422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:15,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068874531] [2022-04-27 11:45:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:15,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:15,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:15,585 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:15,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 11:45:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-27 11:45:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:15,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:16,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {1572#true} call ULTIMATE.init(); {1572#true} is VALID [2022-04-27 11:45:16,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1572#true} is VALID [2022-04-27 11:45:16,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#true} {1572#true} #122#return; {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {1572#true} call #t~ret27 := main(); {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {1572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} ~cond := #in~cond; {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} assume !(0 == ~cond); {1572#true} is VALID [2022-04-27 11:45:16,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1572#true} {1572#true} #98#return; {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L272 TraceCheckUtils]: 12: Hoare triple {1572#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1572#true} {1572#true} #100#return; {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {1572#true} is VALID [2022-04-27 11:45:16,317 INFO L272 TraceCheckUtils]: 17: Hoare triple {1572#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {1572#true} is VALID [2022-04-27 11:45:16,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1693#(<= mkdup_~n |mkdup_#in~n|)} is VALID [2022-04-27 11:45:16,318 INFO L272 TraceCheckUtils]: 19: Hoare triple {1693#(<= mkdup_~n |mkdup_#in~n|)} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:16,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:16,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,320 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1693#(<= mkdup_~n |mkdup_#in~n|)} #116#return; {1709#(and (<= mkdup_~n |mkdup_#in~n|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:45:16,321 INFO L272 TraceCheckUtils]: 24: Hoare triple {1709#(and (<= mkdup_~n |mkdup_#in~n|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:16,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:16,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,323 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1709#(and (<= mkdup_~n |mkdup_#in~n|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {1725#(and (<= 0 mkdup_~j~0) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:16,323 INFO L272 TraceCheckUtils]: 29: Hoare triple {1725#(and (<= 0 mkdup_~j~0) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:16,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} ~cond := #in~cond; {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:16,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {1630#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:16,325 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1725#(and (<= 0 mkdup_~j~0) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} #120#return; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:16,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:16,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume true; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:16,327 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1629#(<= 2 |mkdup_#in~n|)} {1572#true} #102#return; {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:16,327 INFO L290 TraceCheckUtils]: 37: Hoare triple {1603#(<= 2 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:16,327 INFO L272 TraceCheckUtils]: 38: Hoare triple {1603#(<= 2 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {1572#true} is VALID [2022-04-27 11:45:16,328 INFO L290 TraceCheckUtils]: 39: Hoare triple {1572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1759#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0))} is VALID [2022-04-27 11:45:16,328 INFO L290 TraceCheckUtils]: 40: Hoare triple {1759#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1763#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:16,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {1763#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~j~1 1))} assume !(~j~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:16,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {1635#(<= |finddup_#in~n| 1)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:16,329 INFO L290 TraceCheckUtils]: 43: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume !(~i~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:16,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {1635#(<= |finddup_#in~n| 1)} #res := 0; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:16,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume true; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:16,332 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1635#(<= |finddup_#in~n| 1)} {1603#(<= 2 main_~n~0)} #104#return; {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {1573#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L272 TraceCheckUtils]: 48: Hoare triple {1573#false} call __VERIFIER_assert(~r~0); {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {1573#false} ~cond := #in~cond; {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L290 TraceCheckUtils]: 50: Hoare triple {1573#false} assume 0 == ~cond; {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2022-04-27 11:45:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:16,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:18,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {1573#false} assume !false; {1573#false} is VALID [2022-04-27 11:45:18,564 INFO L290 TraceCheckUtils]: 50: Hoare triple {1573#false} assume 0 == ~cond; {1573#false} is VALID [2022-04-27 11:45:18,564 INFO L290 TraceCheckUtils]: 49: Hoare triple {1573#false} ~cond := #in~cond; {1573#false} is VALID [2022-04-27 11:45:18,564 INFO L272 TraceCheckUtils]: 48: Hoare triple {1573#false} call __VERIFIER_assert(~r~0); {1573#false} is VALID [2022-04-27 11:45:18,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {1573#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {1573#false} is VALID [2022-04-27 11:45:18,565 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1635#(<= |finddup_#in~n| 1)} {1603#(<= 2 main_~n~0)} #104#return; {1573#false} is VALID [2022-04-27 11:45:18,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume true; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:18,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {1635#(<= |finddup_#in~n| 1)} #res := 0; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:18,567 INFO L290 TraceCheckUtils]: 43: Hoare triple {1635#(<= |finddup_#in~n| 1)} assume !(~i~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:18,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {1635#(<= |finddup_#in~n| 1)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:18,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {1830#(or (<= |finddup_#in~n| 1) (< finddup_~j~1 finddup_~n))} assume !(~j~1 < ~n); {1635#(<= |finddup_#in~n| 1)} is VALID [2022-04-27 11:45:18,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {1834#(or (<= |finddup_#in~n| 1) (< (+ finddup_~i~1 1) finddup_~n))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {1830#(or (<= |finddup_#in~n| 1) (< finddup_~j~1 finddup_~n))} is VALID [2022-04-27 11:45:18,569 INFO L290 TraceCheckUtils]: 39: Hoare triple {1572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {1834#(or (<= |finddup_#in~n| 1) (< (+ finddup_~i~1 1) finddup_~n))} is VALID [2022-04-27 11:45:18,569 INFO L272 TraceCheckUtils]: 38: Hoare triple {1603#(<= 2 main_~n~0)} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {1572#true} is VALID [2022-04-27 11:45:18,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {1603#(<= 2 main_~n~0)} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:18,570 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1629#(<= 2 |mkdup_#in~n|)} {1572#true} #102#return; {1603#(<= 2 main_~n~0)} is VALID [2022-04-27 11:45:18,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume true; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:18,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {1629#(<= 2 |mkdup_#in~n|)} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:18,571 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} #120#return; {1629#(<= 2 |mkdup_#in~n|)} is VALID [2022-04-27 11:45:18,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,572 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} ~cond := #in~cond; {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:45:18,572 INFO L272 TraceCheckUtils]: 29: Hoare triple {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:18,573 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1872#(or (and (or (<= mkdup_~n 0) (<= mkdup_~i~0 0)) (or (<= mkdup_~n 0) (<= mkdup_~n (+ mkdup_~i~0 1)))) (<= 2 |mkdup_#in~n|))} #118#return; {1624#(or (= mkdup_~j~0 mkdup_~i~0) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:18,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} ~cond := #in~cond; {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:45:18,574 INFO L272 TraceCheckUtils]: 24: Hoare triple {1872#(or (and (or (<= mkdup_~n 0) (<= mkdup_~i~0 0)) (or (<= mkdup_~n 0) (<= mkdup_~n (+ mkdup_~i~0 1)))) (<= 2 |mkdup_#in~n|))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:18,575 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} {1888#(or (<= mkdup_~n 1) (<= 2 |mkdup_#in~n|))} #116#return; {1872#(or (and (or (<= mkdup_~n 0) (<= mkdup_~i~0 0)) (or (<= mkdup_~n 0) (<= mkdup_~n (+ mkdup_~i~0 1)))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:18,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {1631#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1631#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:18,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} ~cond := #in~cond; {1865#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 11:45:18,577 INFO L272 TraceCheckUtils]: 19: Hoare triple {1888#(or (<= mkdup_~n 1) (<= 2 |mkdup_#in~n|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:18,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {1572#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {1888#(or (<= mkdup_~n 1) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:18,577 INFO L272 TraceCheckUtils]: 17: Hoare triple {1572#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {1572#true} is VALID [2022-04-27 11:45:18,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {1572#true} is VALID [2022-04-27 11:45:18,577 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1572#true} {1572#true} #100#return; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L272 TraceCheckUtils]: 12: Hoare triple {1572#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1572#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1572#true} {1572#true} #98#return; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} assume !(0 == ~cond); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} ~cond := #in~cond; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L272 TraceCheckUtils]: 6: Hoare triple {1572#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1572#true} call #t~ret27 := main(); {1572#true} is VALID [2022-04-27 11:45:18,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#true} {1572#true} #122#return; {1572#true} is VALID [2022-04-27 11:45:18,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} assume true; {1572#true} is VALID [2022-04-27 11:45:18,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1572#true} is VALID [2022-04-27 11:45:18,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {1572#true} call ULTIMATE.init(); {1572#true} is VALID [2022-04-27 11:45:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 11:45:18,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068874531] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:18,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:45:18,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [15, 12] total 25 [2022-04-27 11:45:18,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833709325] [2022-04-27 11:45:18,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:18,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-04-27 11:45:18,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:18,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 11:45:18,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:18,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 11:45:18,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:18,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 11:45:18,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:45:18,626 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 11:45:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:19,224 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-04-27 11:45:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:45:19,224 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 52 [2022-04-27 11:45:19,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 11:45:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 11:45:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 11:45:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 11:45:19,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2022-04-27 11:45:19,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:19,323 INFO L225 Difference]: With dead ends: 104 [2022-04-27 11:45:19,323 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 11:45:19,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:45:19,324 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 43 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:19,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 386 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:45:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 11:45:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-04-27 11:45:19,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:19,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:19,349 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:19,349 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:19,352 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 11:45:19,352 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 11:45:19,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:19,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:19,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 70 states. [2022-04-27 11:45:19,353 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 70 states. [2022-04-27 11:45:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:19,355 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 11:45:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 11:45:19,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:19,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:19,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:19,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.15) internal successors, (46), 42 states have internal predecessors, (46), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:19,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-04-27 11:45:19,358 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 52 [2022-04-27 11:45:19,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:19,358 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-04-27 11:45:19,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 11:45:19,359 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-04-27 11:45:19,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-27 11:45:19,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:19,359 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:19,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:45:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 11:45:19,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:19,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2045094069, now seen corresponding path program 1 times [2022-04-27 11:45:19,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:19,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376347249] [2022-04-27 11:45:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {2376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2334#true} is VALID [2022-04-27 11:45:19,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2334#true} {2334#true} #122#return; {2334#true} is VALID [2022-04-27 11:45:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #98#return; {2334#true} is VALID [2022-04-27 11:45:19,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2334#true} is VALID [2022-04-27 11:45:19,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2334#true} {2334#true} #100#return; {2334#true} is VALID [2022-04-27 11:45:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #116#return; {2334#true} is VALID [2022-04-27 11:45:19,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #118#return; {2334#true} is VALID [2022-04-27 11:45:19,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #120#return; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L272 TraceCheckUtils]: 1: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2334#true} {2334#true} #116#return; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L272 TraceCheckUtils]: 6: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2334#true} {2334#true} #118#return; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L272 TraceCheckUtils]: 11: Hoare triple {2334#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2334#true} {2334#true} #120#return; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,659 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2334#true} {2334#true} #102#return; {2334#true} is VALID [2022-04-27 11:45:19,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:19,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {2334#true} is VALID [2022-04-27 11:45:19,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:19,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {2392#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:19,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {2392#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {2335#false} is VALID [2022-04-27 11:45:19,694 INFO L290 TraceCheckUtils]: 8: Hoare triple {2335#false} #res := 0; {2335#false} is VALID [2022-04-27 11:45:19,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {2335#false} assume true; {2335#false} is VALID [2022-04-27 11:45:19,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2335#false} {2334#true} #104#return; {2335#false} is VALID [2022-04-27 11:45:19,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:19,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {2376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2334#true} is VALID [2022-04-27 11:45:19,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #122#return; {2334#true} is VALID [2022-04-27 11:45:19,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret27 := main(); {2334#true} is VALID [2022-04-27 11:45:19,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {2334#true} is VALID [2022-04-27 11:45:19,695 INFO L272 TraceCheckUtils]: 6: Hoare triple {2334#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,696 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2334#true} {2334#true} #98#return; {2334#true} is VALID [2022-04-27 11:45:19,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2334#true} is VALID [2022-04-27 11:45:19,697 INFO L272 TraceCheckUtils]: 12: Hoare triple {2334#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {2377#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:19,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2334#true} is VALID [2022-04-27 11:45:19,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2334#true} {2334#true} #100#return; {2334#true} is VALID [2022-04-27 11:45:19,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {2334#true} is VALID [2022-04-27 11:45:19,700 INFO L272 TraceCheckUtils]: 17: Hoare triple {2334#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {2377#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:19,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L272 TraceCheckUtils]: 19: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2334#true} {2334#true} #116#return; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L290 TraceCheckUtils]: 27: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2334#true} {2334#true} #118#return; {2334#true} is VALID [2022-04-27 11:45:19,701 INFO L272 TraceCheckUtils]: 29: Hoare triple {2334#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2334#true} {2334#true} #120#return; {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {2334#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2334#true} {2334#true} #102#return; {2334#true} is VALID [2022-04-27 11:45:19,702 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {2334#true} is VALID [2022-04-27 11:45:19,703 INFO L272 TraceCheckUtils]: 38: Hoare triple {2334#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {2377#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:19,703 INFO L290 TraceCheckUtils]: 39: Hoare triple {2377#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {2334#true} is VALID [2022-04-27 11:45:19,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {2334#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:19,704 INFO L290 TraceCheckUtils]: 41: Hoare triple {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,706 INFO L290 TraceCheckUtils]: 45: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {2392#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:19,706 INFO L290 TraceCheckUtils]: 46: Hoare triple {2392#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {2335#false} is VALID [2022-04-27 11:45:19,706 INFO L290 TraceCheckUtils]: 47: Hoare triple {2335#false} #res := 0; {2335#false} is VALID [2022-04-27 11:45:19,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {2335#false} assume true; {2335#false} is VALID [2022-04-27 11:45:19,706 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2335#false} {2334#true} #104#return; {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {2335#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L272 TraceCheckUtils]: 51: Hoare triple {2335#false} call __VERIFIER_assert(~r~0); {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L290 TraceCheckUtils]: 53: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L290 TraceCheckUtils]: 54: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-27 11:45:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:19,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:19,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376347249] [2022-04-27 11:45:19,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376347249] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:19,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157722634] [2022-04-27 11:45:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:19,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:19,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:19,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:19,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 11:45:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 11:45:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:19,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:19,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-27 11:45:19,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2334#true} is VALID [2022-04-27 11:45:19,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #122#return; {2334#true} is VALID [2022-04-27 11:45:19,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret27 := main(); {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {2334#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2334#true} {2334#true} #98#return; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L272 TraceCheckUtils]: 12: Hoare triple {2334#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2334#true} {2334#true} #100#return; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L272 TraceCheckUtils]: 17: Hoare triple {2334#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L272 TraceCheckUtils]: 19: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2334#true} {2334#true} #116#return; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 27: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2334#true} {2334#true} #118#return; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L272 TraceCheckUtils]: 29: Hoare triple {2334#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,965 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2334#true} {2334#true} #120#return; {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {2334#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L290 TraceCheckUtils]: 35: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2334#true} {2334#true} #102#return; {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L272 TraceCheckUtils]: 38: Hoare triple {2334#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {2334#true} is VALID [2022-04-27 11:45:19,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {2334#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {2334#true} is VALID [2022-04-27 11:45:19,968 INFO L290 TraceCheckUtils]: 40: Hoare triple {2334#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:19,969 INFO L290 TraceCheckUtils]: 41: Hoare triple {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,969 INFO L290 TraceCheckUtils]: 42: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:19,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {2392#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:19,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {2392#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {2335#false} is VALID [2022-04-27 11:45:19,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {2335#false} #res := 0; {2335#false} is VALID [2022-04-27 11:45:19,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {2335#false} assume true; {2335#false} is VALID [2022-04-27 11:45:19,971 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2335#false} {2334#true} #104#return; {2335#false} is VALID [2022-04-27 11:45:19,971 INFO L290 TraceCheckUtils]: 50: Hoare triple {2335#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {2335#false} is VALID [2022-04-27 11:45:19,972 INFO L272 TraceCheckUtils]: 51: Hoare triple {2335#false} call __VERIFIER_assert(~r~0); {2335#false} is VALID [2022-04-27 11:45:19,972 INFO L290 TraceCheckUtils]: 52: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-27 11:45:19,972 INFO L290 TraceCheckUtils]: 53: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-27 11:45:19,972 INFO L290 TraceCheckUtils]: 54: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-27 11:45:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:19,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:20,155 INFO L290 TraceCheckUtils]: 54: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L272 TraceCheckUtils]: 51: Hoare triple {2335#false} call __VERIFIER_assert(~r~0); {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {2335#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {2335#false} {2334#true} #104#return; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {2335#false} assume true; {2335#false} is VALID [2022-04-27 11:45:20,156 INFO L290 TraceCheckUtils]: 47: Hoare triple {2335#false} #res := 0; {2335#false} is VALID [2022-04-27 11:45:20,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {2392#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {2335#false} is VALID [2022-04-27 11:45:20,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {2392#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:20,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:20,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:20,159 INFO L290 TraceCheckUtils]: 42: Hoare triple {2391#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:20,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {2391#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {2334#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {2390#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {2334#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L272 TraceCheckUtils]: 38: Hoare triple {2334#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {2334#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2334#true} {2334#true} #102#return; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {2334#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2334#true} {2334#true} #120#return; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L272 TraceCheckUtils]: 29: Hoare triple {2334#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2334#true} {2334#true} #118#return; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:20,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L272 TraceCheckUtils]: 24: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2334#true} {2334#true} #116#return; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L272 TraceCheckUtils]: 19: Hoare triple {2334#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L272 TraceCheckUtils]: 17: Hoare triple {2334#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {2334#true} is VALID [2022-04-27 11:45:20,161 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2334#true} {2334#true} #100#return; {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L272 TraceCheckUtils]: 12: Hoare triple {2334#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2334#true} {2334#true} #98#return; {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !(0 == ~cond); {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} ~cond := #in~cond; {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {2334#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {2334#true} is VALID [2022-04-27 11:45:20,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret27 := main(); {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #122#return; {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-27 11:45:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:20,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157722634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:20,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:45:20,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-04-27 11:45:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081420323] [2022-04-27 11:45:20,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2022-04-27 11:45:20,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:20,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:20,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:20,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 11:45:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 11:45:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-27 11:45:20,206 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:20,697 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-04-27 11:45:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 11:45:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 55 [2022-04-27 11:45:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:20,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-27 11:45:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-27 11:45:20,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-27 11:45:20,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:20,800 INFO L225 Difference]: With dead ends: 88 [2022-04-27 11:45:20,801 INFO L226 Difference]: Without dead ends: 67 [2022-04-27 11:45:20,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:45:20,802 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 66 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:20,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 51 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:45:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-27 11:45:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-27 11:45:20,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:20,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:20,854 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:20,855 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:20,857 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 11:45:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 11:45:20,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:20,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:20,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 67 states. [2022-04-27 11:45:20,858 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) Second operand 67 states. [2022-04-27 11:45:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:20,862 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-04-27 11:45:20,862 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 11:45:20,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:20,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:20,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:20,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-27 11:45:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-27 11:45:20,865 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 55 [2022-04-27 11:45:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:20,865 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-27 11:45:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-27 11:45:20,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 11:45:20,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:20,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:20,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 11:45:21,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:21,087 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:21,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 629236887, now seen corresponding path program 1 times [2022-04-27 11:45:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:21,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351798452] [2022-04-27 11:45:21,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {3135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3086#true} is VALID [2022-04-27 11:45:21,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3086#true} {3086#true} #122#return; {3086#true} is VALID [2022-04-27 11:45:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #98#return; {3086#true} is VALID [2022-04-27 11:45:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3086#true} is VALID [2022-04-27 11:45:21,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3086#true} {3086#true} #100#return; {3086#true} is VALID [2022-04-27 11:45:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #116#return; {3086#true} is VALID [2022-04-27 11:45:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #118#return; {3086#true} is VALID [2022-04-27 11:45:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #120#return; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L272 TraceCheckUtils]: 1: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3086#true} {3086#true} #116#return; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L272 TraceCheckUtils]: 6: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3086#true} {3086#true} #118#return; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L272 TraceCheckUtils]: 11: Hoare triple {3086#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3086#true} {3086#true} #120#return; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {3086#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3086#true} {3086#true} #102#return; {3086#true} is VALID [2022-04-27 11:45:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {3149#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {3149#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {3150#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {3150#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {3151#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {3151#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} is VALID [2022-04-27 11:45:21,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} assume true; {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} is VALID [2022-04-27 11:45:21,453 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} {3117#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {3124#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0)) (<= 2 main_~n~0))} is VALID [2022-04-27 11:45:21,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:45:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {3086#true} ~cond := #in~cond; {3153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:21,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {3153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:21,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:21,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} {3125#(and (or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (<= 2 main_~n~0))} #106#return; {3130#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 main_~n~0))} is VALID [2022-04-27 11:45:21,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {3086#true} call ULTIMATE.init(); {3135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {3135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #122#return; {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {3086#true} call #t~ret27 := main(); {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {3086#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {3086#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3086#true} {3086#true} #98#return; {3086#true} is VALID [2022-04-27 11:45:21,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {3086#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3086#true} is VALID [2022-04-27 11:45:21,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {3086#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {3136#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:21,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3086#true} is VALID [2022-04-27 11:45:21,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,482 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3086#true} {3086#true} #100#return; {3086#true} is VALID [2022-04-27 11:45:21,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {3086#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {3086#true} is VALID [2022-04-27 11:45:21,482 INFO L272 TraceCheckUtils]: 17: Hoare triple {3086#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {3136#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L272 TraceCheckUtils]: 19: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3086#true} {3086#true} #116#return; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L272 TraceCheckUtils]: 24: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,483 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3086#true} {3086#true} #118#return; {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L272 TraceCheckUtils]: 29: Hoare triple {3086#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3086#true} {3086#true} #120#return; {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {3086#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:21,484 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3086#true} {3086#true} #102#return; {3086#true} is VALID [2022-04-27 11:45:21,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {3086#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {3117#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:45:21,486 INFO L272 TraceCheckUtils]: 38: Hoare triple {3117#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {3136#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:21,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {3136#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {3149#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {3149#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {3150#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,488 INFO L290 TraceCheckUtils]: 41: Hoare triple {3150#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= |finddup_#in~n| finddup_~n) (= finddup_~i~1 0) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {3151#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:21,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {3151#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} is VALID [2022-04-27 11:45:21,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} assume true; {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} is VALID [2022-04-27 11:45:21,491 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3152#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 |finddup_#in~n|))} {3117#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {3124#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0)) (<= 2 main_~n~0))} is VALID [2022-04-27 11:45:21,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {3124#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0)) (<= 2 main_~n~0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {3125#(and (or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (<= 2 main_~n~0))} is VALID [2022-04-27 11:45:21,491 INFO L272 TraceCheckUtils]: 46: Hoare triple {3125#(and (or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (<= 2 main_~n~0))} call __VERIFIER_assert(~r~0); {3086#true} is VALID [2022-04-27 11:45:21,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {3086#true} ~cond := #in~cond; {3153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:21,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {3153#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:21,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:21,493 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} {3125#(and (or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (<= 2 main_~n~0))} #106#return; {3130#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 main_~n~0))} is VALID [2022-04-27 11:45:21,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {3130#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 main_~n~0))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {3131#(<= (+ 2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0)} is VALID [2022-04-27 11:45:21,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {3131#(<= (+ 2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0)} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {3132#|main_#t~short17|} is VALID [2022-04-27 11:45:21,497 INFO L272 TraceCheckUtils]: 53: Hoare triple {3132#|main_#t~short17|} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:21,499 INFO L290 TraceCheckUtils]: 54: Hoare triple {3133#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3134#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:21,499 INFO L290 TraceCheckUtils]: 55: Hoare triple {3134#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3087#false} is VALID [2022-04-27 11:45:21,500 INFO L290 TraceCheckUtils]: 56: Hoare triple {3087#false} assume !false; {3087#false} is VALID [2022-04-27 11:45:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:21,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351798452] [2022-04-27 11:45:21,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351798452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:21,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661763938] [2022-04-27 11:45:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:21,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:21,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:21,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 11:45:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-27 11:45:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:21,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:21,698 INFO L390 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 10 treesize of output 8 [2022-04-27 11:45:21,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 14 [2022-04-27 11:45:21,928 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-04-27 11:45:21,928 INFO L390 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 1 case distinctions, treesize of input 16 treesize of output 22 [2022-04-27 11:45:21,940 INFO L390 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 7 treesize of output 5 [2022-04-27 11:45:22,189 INFO L390 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 17 treesize of output 9 [2022-04-27 11:45:22,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {3086#true} call ULTIMATE.init(); {3086#true} is VALID [2022-04-27 11:45:22,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {3086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3086#true} is VALID [2022-04-27 11:45:22,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3086#true} {3086#true} #122#return; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {3086#true} call #t~ret27 := main(); {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {3086#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {3086#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3086#true} {3086#true} #98#return; {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {3086#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L272 TraceCheckUtils]: 12: Hoare triple {3086#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {3086#true} is VALID [2022-04-27 11:45:22,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {3086#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3086#true} {3086#true} #100#return; {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {3086#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L272 TraceCheckUtils]: 17: Hoare triple {3086#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {3086#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {3086#true} is VALID [2022-04-27 11:45:22,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:22,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:22,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:22,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,307 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3086#true} {3086#true} #116#return; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L272 TraceCheckUtils]: 24: Hoare triple {3086#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3086#true} {3086#true} #118#return; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L272 TraceCheckUtils]: 29: Hoare triple {3086#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,308 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3086#true} {3086#true} #120#return; {3086#true} is VALID [2022-04-27 11:45:22,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {3086#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {3086#true} is VALID [2022-04-27 11:45:22,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,309 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3086#true} {3086#true} #102#return; {3086#true} is VALID [2022-04-27 11:45:22,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {3086#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {3268#(and (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:45:22,310 INFO L272 TraceCheckUtils]: 38: Hoare triple {3268#(and (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {3086#true} is VALID [2022-04-27 11:45:22,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {3086#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {3275#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base) (<= finddup_~n |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:45:22,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {3275#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base) (<= finddup_~n |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {3279#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (<= finddup_~n |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:45:22,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {3279#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (<= finddup_~n |finddup_#in~n|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {3283#(and (= |finddup_#in~_j.base| finddup_~_j.base) (< (+ finddup_~i~1 1) |finddup_#in~n|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:45:22,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {3283#(and (= |finddup_#in~_j.base| finddup_~_j.base) (< (+ finddup_~i~1 1) |finddup_#in~n|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {3287#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (< (+ (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 1) |finddup_#in~n|))} is VALID [2022-04-27 11:45:22,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {3287#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (< (+ (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 1) |finddup_#in~n|))} assume true; {3287#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (< (+ (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 1) |finddup_#in~n|))} is VALID [2022-04-27 11:45:22,314 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3287#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (< (+ (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 1) |finddup_#in~n|))} {3268#(and (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:45:22,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:45:22,314 INFO L272 TraceCheckUtils]: 46: Hoare triple {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert(~r~0); {3086#true} is VALID [2022-04-27 11:45:22,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {3086#true} ~cond := #in~cond; {3086#true} is VALID [2022-04-27 11:45:22,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {3086#true} assume !(0 == ~cond); {3086#true} is VALID [2022-04-27 11:45:22,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {3086#true} assume true; {3086#true} is VALID [2022-04-27 11:45:22,315 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3086#true} {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} #106#return; {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:45:22,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:45:22,316 INFO L290 TraceCheckUtils]: 52: Hoare triple {3294#(and (< (+ 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) main_~n~0) (= |main_~#i~2.offset| 0))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {3132#|main_#t~short17|} is VALID [2022-04-27 11:45:22,317 INFO L272 TraceCheckUtils]: 53: Hoare triple {3132#|main_#t~short17|} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {3322#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:45:22,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {3322#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3326#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:22,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {3326#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3087#false} is VALID [2022-04-27 11:45:22,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {3087#false} assume !false; {3087#false} is VALID [2022-04-27 11:45:22,318 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:22,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:45:22,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661763938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:22,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:45:22,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [17] total 25 [2022-04-27 11:45:22,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429552713] [2022-04-27 11:45:22,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:22,319 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 11:45:22,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:22,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:22,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:22,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:45:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:45:22,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:45:22,357 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:23,122 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2022-04-27 11:45:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 11:45:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 11:45:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:23,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-27 11:45:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2022-04-27 11:45:23,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 96 transitions. [2022-04-27 11:45:23,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:23,209 INFO L225 Difference]: With dead ends: 85 [2022-04-27 11:45:23,209 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 11:45:23,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2022-04-27 11:45:23,210 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:23,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 428 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:45:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 11:45:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2022-04-27 11:45:23,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:23,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 11:45:23,250 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 11:45:23,251 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 11:45:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:23,254 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-04-27 11:45:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2022-04-27 11:45:23,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:23,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:23,254 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 83 states. [2022-04-27 11:45:23,255 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) Second operand 83 states. [2022-04-27 11:45:23,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:23,258 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-04-27 11:45:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2022-04-27 11:45:23,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:23,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:23,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:23,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 50 states have internal predecessors, (56), 16 states have call successors, (16), 9 states have call predecessors, (16), 9 states have return successors, (15), 14 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-27 11:45:23,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 87 transitions. [2022-04-27 11:45:23,261 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 87 transitions. Word has length 57 [2022-04-27 11:45:23,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:23,261 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 87 transitions. [2022-04-27 11:45:23,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:23,261 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 87 transitions. [2022-04-27 11:45:23,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 11:45:23,262 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:23,262 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:23,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 11:45:23,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:23,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:23,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:23,464 INFO L85 PathProgramCache]: Analyzing trace with hash 631083929, now seen corresponding path program 1 times [2022-04-27 11:45:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:23,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999888596] [2022-04-27 11:45:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:23,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3733#true} is VALID [2022-04-27 11:45:23,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,534 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3733#true} {3733#true} #122#return; {3733#true} is VALID [2022-04-27 11:45:23,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,536 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #98#return; {3733#true} is VALID [2022-04-27 11:45:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3733#true} is VALID [2022-04-27 11:45:23,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3733#true} {3733#true} #100#return; {3733#true} is VALID [2022-04-27 11:45:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #116#return; {3733#true} is VALID [2022-04-27 11:45:23,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #118#return; {3733#true} is VALID [2022-04-27 11:45:23,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #120#return; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L272 TraceCheckUtils]: 1: Hoare triple {3733#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3733#true} {3733#true} #116#return; {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L272 TraceCheckUtils]: 6: Hoare triple {3733#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3733#true} {3733#true} #118#return; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L272 TraceCheckUtils]: 11: Hoare triple {3733#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3733#true} {3733#true} #120#return; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {3733#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,563 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3733#true} {3733#true} #102#return; {3733#true} is VALID [2022-04-27 11:45:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,613 INFO L290 TraceCheckUtils]: 3: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} is VALID [2022-04-27 11:45:23,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} assume true; {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} is VALID [2022-04-27 11:45:23,614 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} {3764#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {3771#(or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} is VALID [2022-04-27 11:45:23,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:45:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:23,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {3733#true} ~cond := #in~cond; {3795#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:23,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:23,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:23,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} {3772#(or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {3777#(= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} is VALID [2022-04-27 11:45:23,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {3733#true} call ULTIMATE.init(); {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {3779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3733#true} {3733#true} #122#return; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {3733#true} call #t~ret27 := main(); {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {3733#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {3733#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3733#true} {3733#true} #98#return; {3733#true} is VALID [2022-04-27 11:45:23,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {3733#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {3733#true} is VALID [2022-04-27 11:45:23,643 INFO L272 TraceCheckUtils]: 12: Hoare triple {3733#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {3780#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {3733#true} is VALID [2022-04-27 11:45:23,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,644 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3733#true} {3733#true} #100#return; {3733#true} is VALID [2022-04-27 11:45:23,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {3733#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {3733#true} is VALID [2022-04-27 11:45:23,644 INFO L272 TraceCheckUtils]: 17: Hoare triple {3733#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {3780#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {3733#true} is VALID [2022-04-27 11:45:23,644 INFO L272 TraceCheckUtils]: 19: Hoare triple {3733#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 22: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3733#true} {3733#true} #116#return; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L272 TraceCheckUtils]: 24: Hoare triple {3733#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 25: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3733#true} {3733#true} #118#return; {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L272 TraceCheckUtils]: 29: Hoare triple {3733#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {3733#true} is VALID [2022-04-27 11:45:23,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {3733#true} ~cond := #in~cond; {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {3733#true} assume !(0 == ~cond); {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3733#true} {3733#true} #120#return; {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {3733#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {3733#true} assume true; {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3733#true} {3733#true} #102#return; {3733#true} is VALID [2022-04-27 11:45:23,646 INFO L290 TraceCheckUtils]: 37: Hoare triple {3733#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {3764#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:45:23,648 INFO L272 TraceCheckUtils]: 38: Hoare triple {3764#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {3780#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:23,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {3780#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,649 INFO L290 TraceCheckUtils]: 41: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:45:23,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {3793#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (= finddup_~i~1 0) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} is VALID [2022-04-27 11:45:23,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} assume true; {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} is VALID [2022-04-27 11:45:23,652 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {3794#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))} {3764#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {3771#(or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} is VALID [2022-04-27 11:45:23,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {3771#(or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {3772#(or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:45:23,652 INFO L272 TraceCheckUtils]: 46: Hoare triple {3772#(or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert(~r~0); {3733#true} is VALID [2022-04-27 11:45:23,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {3733#true} ~cond := #in~cond; {3795#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:45:23,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {3795#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:23,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:23,654 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3796#(not (= |__VERIFIER_assert_#in~cond| 0))} {3772#(or (= main_~r~0 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {3777#(= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} is VALID [2022-04-27 11:45:23,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {3777#(= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {3778#|main_#t~short17|} is VALID [2022-04-27 11:45:23,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {3778#|main_#t~short17|} assume !#t~short17; {3734#false} is VALID [2022-04-27 11:45:23,655 INFO L272 TraceCheckUtils]: 53: Hoare triple {3734#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {3734#false} is VALID [2022-04-27 11:45:23,655 INFO L290 TraceCheckUtils]: 54: Hoare triple {3734#false} ~cond := #in~cond; {3734#false} is VALID [2022-04-27 11:45:23,655 INFO L290 TraceCheckUtils]: 55: Hoare triple {3734#false} assume 0 == ~cond; {3734#false} is VALID [2022-04-27 11:45:23,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {3734#false} assume !false; {3734#false} is VALID [2022-04-27 11:45:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:23,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:23,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999888596] [2022-04-27 11:45:23,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999888596] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:23,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:23,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-27 11:45:23,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941631106] [2022-04-27 11:45:23,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:23,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 11:45:23,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:23,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:23,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:23,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:45:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:23,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:45:23,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:45:23,694 INFO L87 Difference]: Start difference. First operand 74 states and 87 transitions. Second operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:25,141 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2022-04-27 11:45:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:45:25,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-27 11:45:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-27 11:45:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 111 transitions. [2022-04-27 11:45:25,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 111 transitions. [2022-04-27 11:45:25,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:25,247 INFO L225 Difference]: With dead ends: 106 [2022-04-27 11:45:25,247 INFO L226 Difference]: Without dead ends: 92 [2022-04-27 11:45:25,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2022-04-27 11:45:25,248 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 100 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:25,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 58 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 11:45:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-27 11:45:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-04-27 11:45:25,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:25,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:25,295 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:25,295 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:25,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:25,298 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-27 11:45:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-04-27 11:45:25,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:25,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:25,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 92 states. [2022-04-27 11:45:25,299 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 92 states. [2022-04-27 11:45:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:25,302 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-27 11:45:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-04-27 11:45:25,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:25,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:25,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:25,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:25,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:25,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2022-04-27 11:45:25,305 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 57 [2022-04-27 11:45:25,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:25,306 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2022-04-27 11:45:25,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:45:25,306 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2022-04-27 11:45:25,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 11:45:25,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:25,307 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:25,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 11:45:25,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:25,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1636680555, now seen corresponding path program 2 times [2022-04-27 11:45:25,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:25,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178231882] [2022-04-27 11:45:25,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:25,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {4314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4266#true} is VALID [2022-04-27 11:45:25,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:25,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4266#true} {4266#true} #122#return; {4266#true} is VALID [2022-04-27 11:45:25,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4266#true} is VALID [2022-04-27 11:45:25,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume !(0 == ~cond); {4266#true} is VALID [2022-04-27 11:45:25,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:25,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4266#true} {4266#true} #98#return; {4266#true} is VALID [2022-04-27 11:45:25,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-04-27 11:45:25,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:25,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4266#true} {4275#(= |main_#t~malloc13.offset| 0)} #100#return; {4275#(= |main_#t~malloc13.offset| 0)} is VALID [2022-04-27 11:45:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:25,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:25,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:25,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:25,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} #116#return; {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:45:25,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:45:26,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} #120#return; {4331#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~a.offset (+ (* mkdup_~j~0 4) mkdup_~a.offset)) (< 0 mkdup_~j~0)) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} is VALID [2022-04-27 11:45:26,021 INFO L272 TraceCheckUtils]: 1: Hoare triple {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,023 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} #116#return; {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:45:26,023 INFO L272 TraceCheckUtils]: 6: Hoare triple {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:45:26,026 INFO L272 TraceCheckUtils]: 11: Hoare triple {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} #120#return; {4331#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~a.offset (+ (* mkdup_~j~0 4) mkdup_~a.offset)) (< 0 mkdup_~j~0)) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {4331#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~a.offset (+ (* mkdup_~j~0 4) mkdup_~a.offset)) (< 0 mkdup_~j~0)) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|))) (<= 2 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} assume true; {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,031 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} {4279#(= main_~a~0.offset 0)} #102#return; {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} is VALID [2022-04-27 11:45:26,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {4335#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (= finddup_~a.offset |finddup_#in~a.offset|) (<= 0 finddup_~i~1) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:45:26,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4335#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (= finddup_~a.offset |finddup_#in~a.offset|) (<= 0 finddup_~i~1) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4336#(and (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~i~1 4))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (<= 1 finddup_~j~1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {4336#(and (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~i~1 4))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (<= 1 finddup_~j~1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {4337#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) |finddup_#t~mem11|) (= |finddup_#in~n| finddup_~n) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {4337#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) |finddup_#t~mem11|) (= |finddup_#in~n| finddup_~n) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (<= finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {4338#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {4338#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {4339#(and (<= finddup_~j~1 2) (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))))} is VALID [2022-04-27 11:45:26,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {4339#(and (<= finddup_~j~1 2) (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))))} assume !(~j~1 < ~n); {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !(~j~1 < ~n); {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !(~i~1 < ~n); {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} #res := 0; {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} assume true; {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,282 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} #104#return; {4267#false} is VALID [2022-04-27 11:45:26,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {4266#true} call ULTIMATE.init(); {4314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:26,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {4314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4266#true} is VALID [2022-04-27 11:45:26,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:26,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4266#true} {4266#true} #122#return; {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {4266#true} call #t~ret27 := main(); {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {4266#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {4266#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {4266#true} ~cond := #in~cond; {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {4266#true} assume !(0 == ~cond); {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4266#true} {4266#true} #98#return; {4266#true} is VALID [2022-04-27 11:45:26,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {4266#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4275#(= |main_#t~malloc13.offset| 0)} is VALID [2022-04-27 11:45:26,284 INFO L272 TraceCheckUtils]: 12: Hoare triple {4275#(= |main_#t~malloc13.offset| 0)} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {4315#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-04-27 11:45:26,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:26,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4266#true} {4275#(= |main_#t~malloc13.offset| 0)} #100#return; {4275#(= |main_#t~malloc13.offset| 0)} is VALID [2022-04-27 11:45:26,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {4275#(= |main_#t~malloc13.offset| 0)} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {4279#(= main_~a~0.offset 0)} is VALID [2022-04-27 11:45:26,286 INFO L272 TraceCheckUtils]: 17: Hoare triple {4279#(= main_~a~0.offset 0)} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {4315#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} is VALID [2022-04-27 11:45:26,287 INFO L272 TraceCheckUtils]: 19: Hoare triple {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,292 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4316#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset))} #116#return; {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:45:26,292 INFO L272 TraceCheckUtils]: 24: Hoare triple {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,299 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4321#(and (or (not (= mkdup_~a.offset 0)) (= mkdup_~a.base |mkdup_#in~a.base|) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (= |mkdup_#in~n| mkdup_~n) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:45:26,299 INFO L272 TraceCheckUtils]: 29: Hoare triple {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:26,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:26,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:26,302 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4326#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (and (<= (+ mkdup_~j~0 1) (+ mkdup_~i~0 |mkdup_#in~n|)) (< mkdup_~i~0 (+ mkdup_~j~0 1))) (<= 2 |mkdup_#in~n|)) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (< 0 mkdup_~j~0) (= (* mkdup_~j~0 4) 0)) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|)) (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} #120#return; {4331#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~a.offset (+ (* mkdup_~j~0 4) mkdup_~a.offset)) (< 0 mkdup_~j~0)) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {4331#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (or (not (= mkdup_~a.offset 0)) (and (or (= (* mkdup_~i~0 4) 0) (<= 1 mkdup_~i~0)) (= mkdup_~a.base |mkdup_#in~a.base|) (<= (+ mkdup_~i~0 1) |mkdup_#in~n|) (or (= mkdup_~a.offset (+ (* mkdup_~j~0 4) mkdup_~a.offset)) (< 0 mkdup_~j~0)) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))) (<= (+ mkdup_~j~0 1) |mkdup_#in~n|))) (<= 2 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} assume true; {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:26,305 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4332#(and (or (not (= |mkdup_#in~a.offset| 0)) (< 8 (* |mkdup_#in~n| 4)) (= (select (select |#memory_int| |mkdup_#in~a.base|) |mkdup_#in~a.offset|) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| 4)))) (<= 2 |mkdup_#in~n|))} {4279#(= main_~a~0.offset 0)} #102#return; {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} is VALID [2022-04-27 11:45:26,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} is VALID [2022-04-27 11:45:26,307 INFO L272 TraceCheckUtils]: 38: Hoare triple {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {4315#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:26,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {4335#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (= finddup_~a.offset |finddup_#in~a.offset|) (<= 0 finddup_~i~1) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:45:26,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {4335#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (= finddup_~a.offset |finddup_#in~a.offset|) (<= 0 finddup_~i~1) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4336#(and (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~i~1 4))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (<= 1 finddup_~j~1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {4336#(and (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~i~1 4))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~n| finddup_~n) (<= 1 finddup_~j~1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {4337#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) |finddup_#t~mem11|) (= |finddup_#in~n| finddup_~n) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {4337#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) |finddup_#t~mem11|) (= |finddup_#in~n| finddup_~n) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (<= finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {4338#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~j~1 1))} is VALID [2022-04-27 11:45:26,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {4338#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {4339#(and (<= finddup_~j~1 2) (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))))} is VALID [2022-04-27 11:45:26,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {4339#(and (<= finddup_~j~1 2) (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))))} assume !(~j~1 < ~n); {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,313 INFO L290 TraceCheckUtils]: 47: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !(~j~1 < ~n); {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,313 INFO L290 TraceCheckUtils]: 48: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} is VALID [2022-04-27 11:45:26,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {4340#(and (= |finddup_#in~n| finddup_~n) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n 2))} assume !(~i~1 < ~n); {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} #res := 0; {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,315 INFO L290 TraceCheckUtils]: 51: Hoare triple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} assume true; {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} is VALID [2022-04-27 11:45:26,316 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4341#(and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= |finddup_#in~n| 2))} {4299#(and (= main_~a~0.offset 0) (or (= (select (select |#memory_int| main_~a~0.base) (+ (* main_~n~0 4) (- 4))) (select (select |#memory_int| main_~a~0.base) (* (div (+ (* main_~n~0 4) (- 8)) 4) 4))) (< 8 (* main_~n~0 4))) (<= 8 (* main_~n~0 4)))} #104#return; {4267#false} is VALID [2022-04-27 11:45:26,316 INFO L290 TraceCheckUtils]: 53: Hoare triple {4267#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {4267#false} is VALID [2022-04-27 11:45:26,316 INFO L272 TraceCheckUtils]: 54: Hoare triple {4267#false} call __VERIFIER_assert(~r~0); {4267#false} is VALID [2022-04-27 11:45:26,316 INFO L290 TraceCheckUtils]: 55: Hoare triple {4267#false} ~cond := #in~cond; {4267#false} is VALID [2022-04-27 11:45:26,316 INFO L290 TraceCheckUtils]: 56: Hoare triple {4267#false} assume 0 == ~cond; {4267#false} is VALID [2022-04-27 11:45:26,317 INFO L290 TraceCheckUtils]: 57: Hoare triple {4267#false} assume !false; {4267#false} is VALID [2022-04-27 11:45:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 11:45:26,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:26,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178231882] [2022-04-27 11:45:26,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178231882] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:26,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266871114] [2022-04-27 11:45:26,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:45:26,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:26,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:26,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:26,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 11:45:26,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:45:26,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:45:26,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-27 11:45:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:26,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:26,925 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-04-27 11:45:26,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 22 treesize of output 23 [2022-04-27 11:45:37,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {4266#true} call ULTIMATE.init(); {4266#true} is VALID [2022-04-27 11:45:37,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4266#true} is VALID [2022-04-27 11:45:37,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4266#true} {4266#true} #122#return; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {4266#true} call #t~ret27 := main(); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {4266#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {4266#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {4266#true} ~cond := #in~cond; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {4266#true} assume !(0 == ~cond); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4266#true} {4266#true} #98#return; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {4266#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L272 TraceCheckUtils]: 12: Hoare triple {4266#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {4266#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4266#true} {4266#true} #100#return; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {4266#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {4266#true} is VALID [2022-04-27 11:45:37,924 INFO L272 TraceCheckUtils]: 17: Hoare triple {4266#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {4266#true} is VALID [2022-04-27 11:45:37,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {4266#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {4399#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:45:37,925 INFO L272 TraceCheckUtils]: 19: Hoare triple {4399#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:37,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:37,926 INFO L290 TraceCheckUtils]: 21: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,927 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4399#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {4415#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:45:37,927 INFO L272 TraceCheckUtils]: 24: Hoare triple {4415#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:37,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:37,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,929 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4415#(and (<= mkdup_~n |mkdup_#in~n|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {4431#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:37,929 INFO L272 TraceCheckUtils]: 29: Hoare triple {4431#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {4266#true} is VALID [2022-04-27 11:45:37,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {4266#true} ~cond := #in~cond; {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:45:37,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {4333#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4334#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:45:37,930 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4334#(not (= |assume_abort_if_not_#in~cond| 0))} {4431#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} #120#return; {4447#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:45:37,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {4447#(and (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {4451#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4))) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)))) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is VALID [2022-04-27 11:45:37,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {4451#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4))) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)))) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} assume true; {4451#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4))) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)))) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is VALID [2022-04-27 11:45:38,964 WARN L284 TraceCheckUtils]: 36: Hoare quadruple {4451#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4))) (select (select |#memory_int| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)))) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} {4266#true} #102#return; {4458#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~j~0 4))) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~i~0 4)))) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:45:38,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {4458#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~j~0 4))) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~i~0 4)))) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {4458#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~j~0 4))) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~i~0 4)))) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is VALID [2022-04-27 11:45:38,972 INFO L272 TraceCheckUtils]: 38: Hoare triple {4458#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~j~0 4))) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~i~0 4)))) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {4315#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:38,972 INFO L290 TraceCheckUtils]: 39: Hoare triple {4315#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {4468#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:45:38,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {4468#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4472#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:45:38,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {4472#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {4476#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= finddup_~i~1 0) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))))} is VALID [2022-04-27 11:45:38,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {4476#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= finddup_~i~1 0) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {4480#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)))) (<= finddup_~j~1 (+ finddup_~i~1 1)))))} is VALID [2022-04-27 11:45:38,983 INFO L290 TraceCheckUtils]: 43: Hoare triple {4480#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)))) (<= finddup_~j~1 (+ finddup_~i~1 1)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {4484#(and (<= |finddup_#in~n| finddup_~n) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= finddup_~j~1 (+ v_finddup_~j~1_25 1)))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:45:38,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {4484#(and (<= |finddup_#in~n| finddup_~n) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= finddup_~j~1 (+ v_finddup_~j~1_25 1)))) (= |#memory_int| |old(#memory_int)|))} assume !(~j~1 < ~n); {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} assume !(~j~1 < ~n); {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} assume !(~i~1 < ~n); {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} #res := 0; {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,176 INFO L290 TraceCheckUtils]: 51: Hoare triple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} assume true; {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} is VALID [2022-04-27 11:45:39,178 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4488#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|)))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))))} {4458#(exists ((mkdup_~j~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~j~0 4))) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset (* mkdup_~i~0 4)))) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} #104#return; {4267#false} is VALID [2022-04-27 11:45:39,178 INFO L290 TraceCheckUtils]: 53: Hoare triple {4267#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {4267#false} is VALID [2022-04-27 11:45:39,179 INFO L272 TraceCheckUtils]: 54: Hoare triple {4267#false} call __VERIFIER_assert(~r~0); {4267#false} is VALID [2022-04-27 11:45:39,179 INFO L290 TraceCheckUtils]: 55: Hoare triple {4267#false} ~cond := #in~cond; {4267#false} is VALID [2022-04-27 11:45:39,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {4267#false} assume 0 == ~cond; {4267#false} is VALID [2022-04-27 11:45:39,179 INFO L290 TraceCheckUtils]: 57: Hoare triple {4267#false} assume !false; {4267#false} is VALID [2022-04-27 11:45:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 11:45:39,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:40,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266871114] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:40,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:45:40,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2022-04-27 11:45:40,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654977146] [2022-04-27 11:45:40,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-04-27 11:45:40,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:40,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 11:45:41,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 82 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:41,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-27 11:45:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-27 11:45:41,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1026, Unknown=4, NotChecked=0, Total=1122 [2022-04-27 11:45:41,977 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 11:45:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:50,726 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2022-04-27 11:45:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-27 11:45:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) Word has length 58 [2022-04-27 11:45:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:50,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 11:45:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2022-04-27 11:45:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 11:45:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 119 transitions. [2022-04-27 11:45:50,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 119 transitions. [2022-04-27 11:45:52,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 118 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:52,934 INFO L225 Difference]: With dead ends: 119 [2022-04-27 11:45:52,934 INFO L226 Difference]: Without dead ends: 98 [2022-04-27 11:45:52,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=284, Invalid=2904, Unknown=4, NotChecked=0, Total=3192 [2022-04-27 11:45:52,936 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 76 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 329 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:52,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 194 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 903 Invalid, 0 Unknown, 329 Unchecked, 0.9s Time] [2022-04-27 11:45:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-27 11:45:53,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-27 11:45:53,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:53,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:53,005 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:53,005 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:53,008 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-27 11:45:53,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-04-27 11:45:53,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:53,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:53,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 98 states. [2022-04-27 11:45:53,009 INFO L87 Difference]: Start difference. First operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 98 states. [2022-04-27 11:45:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:53,012 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-27 11:45:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-04-27 11:45:53,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:53,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:53,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:53,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:53,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 63 states have internal predecessors, (74), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2022-04-27 11:45:53,016 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 108 transitions. Word has length 58 [2022-04-27 11:45:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:53,016 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 108 transitions. [2022-04-27 11:45:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 12 states have call successors, (17), 4 states have call predecessors, (17), 6 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-27 11:45:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-27 11:45:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-27 11:45:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:53,017 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:53,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 11:45:53,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:53,220 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:53,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash 596047115, now seen corresponding path program 3 times [2022-04-27 11:45:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:53,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536703538] [2022-04-27 11:45:53,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {5128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:45:53,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #122#return; {5080#true} is VALID [2022-04-27 11:45:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #98#return; {5080#true} is VALID [2022-04-27 11:45:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5080#true} is VALID [2022-04-27 11:45:53,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,281 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5080#true} {5080#true} #100#return; {5080#true} is VALID [2022-04-27 11:45:53,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:53,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #116#return; {5080#true} is VALID [2022-04-27 11:45:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #118#return; {5080#true} is VALID [2022-04-27 11:45:53,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #120#return; {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L272 TraceCheckUtils]: 1: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 3: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,309 INFO L290 TraceCheckUtils]: 4: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5080#true} {5080#true} #116#return; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5080#true} {5080#true} #118#return; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L272 TraceCheckUtils]: 11: Hoare triple {5080#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,310 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5080#true} {5080#true} #120#return; {5080#true} is VALID [2022-04-27 11:45:53,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {5080#true} is VALID [2022-04-27 11:45:53,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,311 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5080#true} {5080#true} #102#return; {5080#true} is VALID [2022-04-27 11:45:53,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {5080#true} is VALID [2022-04-27 11:45:53,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:45:53,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(~j~1 < ~n); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5146#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {5146#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {5081#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5081#false} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {5081#false} assume !(~i~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {5081#false} #res := 0; {5081#false} is VALID [2022-04-27 11:45:53,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {5081#false} assume true; {5081#false} is VALID [2022-04-27 11:45:53,366 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5081#false} {5080#true} #104#return; {5081#false} is VALID [2022-04-27 11:45:53,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:53,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {5128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #122#return; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret27 := main(); {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L272 TraceCheckUtils]: 6: Hoare triple {5080#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5080#true} {5080#true} #98#return; {5080#true} is VALID [2022-04-27 11:45:53,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {5080#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,368 INFO L272 TraceCheckUtils]: 12: Hoare triple {5080#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {5129#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:53,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5080#true} is VALID [2022-04-27 11:45:53,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,368 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5080#true} {5080#true} #100#return; {5080#true} is VALID [2022-04-27 11:45:53,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {5080#true} is VALID [2022-04-27 11:45:53,369 INFO L272 TraceCheckUtils]: 17: Hoare triple {5080#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {5129#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:53,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {5080#true} is VALID [2022-04-27 11:45:53,369 INFO L272 TraceCheckUtils]: 19: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5080#true} {5080#true} #116#return; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L272 TraceCheckUtils]: 24: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5080#true} {5080#true} #118#return; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L272 TraceCheckUtils]: 29: Hoare triple {5080#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5080#true} {5080#true} #120#return; {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5080#true} {5080#true} #102#return; {5080#true} is VALID [2022-04-27 11:45:53,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {5080#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {5080#true} is VALID [2022-04-27 11:45:53,372 INFO L272 TraceCheckUtils]: 38: Hoare triple {5080#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {5129#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:53,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {5129#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {5080#true} is VALID [2022-04-27 11:45:53,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {5080#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:45:53,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(~j~1 < ~n); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5146#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:45:53,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {5146#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {5081#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5081#false} is VALID [2022-04-27 11:45:53,377 INFO L290 TraceCheckUtils]: 52: Hoare triple {5081#false} assume !(~i~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 53: Hoare triple {5081#false} #res := 0; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 54: Hoare triple {5081#false} assume true; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5081#false} {5080#true} #104#return; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {5081#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L272 TraceCheckUtils]: 57: Hoare triple {5081#false} call __VERIFIER_assert(~r~0); {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {5081#false} ~cond := #in~cond; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 59: Hoare triple {5081#false} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L290 TraceCheckUtils]: 60: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:45:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:53,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536703538] [2022-04-27 11:45:53,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536703538] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:53,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67243292] [2022-04-27 11:45:53,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 11:45:53,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:53,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:53,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:53,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 11:45:53,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 11:45:53,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:45:53,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:45:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:53,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:53,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-27 11:45:53,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:45:53,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #122#return; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret27 := main(); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L272 TraceCheckUtils]: 6: Hoare triple {5080#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5080#true} {5080#true} #98#return; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {5080#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L272 TraceCheckUtils]: 12: Hoare triple {5080#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {5080#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,693 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5080#true} {5080#true} #100#return; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L272 TraceCheckUtils]: 17: Hoare triple {5080#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {5080#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L272 TraceCheckUtils]: 19: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5080#true} {5080#true} #116#return; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L272 TraceCheckUtils]: 24: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5080#true} {5080#true} #118#return; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L272 TraceCheckUtils]: 29: Hoare triple {5080#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 30: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5080#true} {5080#true} #120#return; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5080#true} {5080#true} #102#return; {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {5080#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L272 TraceCheckUtils]: 38: Hoare triple {5080#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {5080#true} is VALID [2022-04-27 11:45:53,695 INFO L290 TraceCheckUtils]: 39: Hoare triple {5080#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {5080#true} is VALID [2022-04-27 11:45:53,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {5080#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:45:53,710 INFO L290 TraceCheckUtils]: 44: Hoare triple {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,710 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,711 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,711 INFO L290 TraceCheckUtils]: 47: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(~j~1 < ~n); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,712 INFO L290 TraceCheckUtils]: 48: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,712 INFO L290 TraceCheckUtils]: 49: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5303#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:53,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {5303#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,713 INFO L290 TraceCheckUtils]: 53: Hoare triple {5081#false} #res := 0; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L290 TraceCheckUtils]: 54: Hoare triple {5081#false} assume true; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5081#false} {5080#true} #104#return; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L290 TraceCheckUtils]: 56: Hoare triple {5081#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L272 TraceCheckUtils]: 57: Hoare triple {5081#false} call __VERIFIER_assert(~r~0); {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L290 TraceCheckUtils]: 58: Hoare triple {5081#false} ~cond := #in~cond; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {5081#false} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L290 TraceCheckUtils]: 60: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:45:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:53,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:53,948 INFO L290 TraceCheckUtils]: 60: Hoare triple {5081#false} assume !false; {5081#false} is VALID [2022-04-27 11:45:53,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {5081#false} assume 0 == ~cond; {5081#false} is VALID [2022-04-27 11:45:53,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {5081#false} ~cond := #in~cond; {5081#false} is VALID [2022-04-27 11:45:53,948 INFO L272 TraceCheckUtils]: 57: Hoare triple {5081#false} call __VERIFIER_assert(~r~0); {5081#false} is VALID [2022-04-27 11:45:53,948 INFO L290 TraceCheckUtils]: 56: Hoare triple {5081#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {5081#false} is VALID [2022-04-27 11:45:53,949 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5081#false} {5080#true} #104#return; {5081#false} is VALID [2022-04-27 11:45:53,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {5081#false} assume true; {5081#false} is VALID [2022-04-27 11:45:53,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {5081#false} #res := 0; {5081#false} is VALID [2022-04-27 11:45:53,949 INFO L290 TraceCheckUtils]: 52: Hoare triple {5303#(<= (+ finddup_~i~1 1) finddup_~n)} assume !(~i~1 < ~n); {5081#false} is VALID [2022-04-27 11:45:53,950 INFO L290 TraceCheckUtils]: 51: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5303#(<= (+ finddup_~i~1 1) finddup_~n)} is VALID [2022-04-27 11:45:53,950 INFO L290 TraceCheckUtils]: 50: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !(~j~1 < ~n); {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {5145#(<= (+ finddup_~i~1 2) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {5145#(<= (+ finddup_~i~1 2) finddup_~n)} is VALID [2022-04-27 11:45:53,952 INFO L290 TraceCheckUtils]: 47: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(~j~1 < ~n); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {5144#(<= (+ finddup_~i~1 3) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5144#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:45:53,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {5143#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:45:53,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {5080#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {5142#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {5080#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L272 TraceCheckUtils]: 38: Hoare triple {5080#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {5080#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5080#true} {5080#true} #102#return; {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {5080#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5080#true} {5080#true} #120#return; {5080#true} is VALID [2022-04-27 11:45:53,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L272 TraceCheckUtils]: 29: Hoare triple {5080#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5080#true} {5080#true} #118#return; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L272 TraceCheckUtils]: 24: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5080#true} {5080#true} #116#return; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L272 TraceCheckUtils]: 19: Hoare triple {5080#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {5080#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L272 TraceCheckUtils]: 17: Hoare triple {5080#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {5080#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5080#true} {5080#true} #100#return; {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {5080#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L272 TraceCheckUtils]: 12: Hoare triple {5080#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {5080#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {5080#true} is VALID [2022-04-27 11:45:53,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5080#true} {5080#true} #98#return; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {5080#true} assume !(0 == ~cond); {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {5080#true} ~cond := #in~cond; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {5080#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {5080#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {5080#true} call #t~ret27 := main(); {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5080#true} {5080#true} #122#return; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {5080#true} assume true; {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5080#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5080#true} is VALID [2022-04-27 11:45:53,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {5080#true} call ULTIMATE.init(); {5080#true} is VALID [2022-04-27 11:45:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:53,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67243292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:53,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:45:53,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 10 [2022-04-27 11:45:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146110055] [2022-04-27 11:45:53,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:53,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-04-27 11:45:53,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:53,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:54,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:54,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:45:54,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:54,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:45:54,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:45:54,019 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:54,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:54,994 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2022-04-27 11:45:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:45:54,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 61 [2022-04-27 11:45:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:54,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:54,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-04-27 11:45:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:54,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2022-04-27 11:45:54,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 116 transitions. [2022-04-27 11:45:55,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:55,106 INFO L225 Difference]: With dead ends: 145 [2022-04-27 11:45:55,106 INFO L226 Difference]: Without dead ends: 101 [2022-04-27 11:45:55,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-04-27 11:45:55,107 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:55,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 59 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:45:55,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-27 11:45:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-04-27 11:45:55,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:55,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:55,192 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:55,192 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:55,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:55,195 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2022-04-27 11:45:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2022-04-27 11:45:55,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:55,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:55,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 101 states. [2022-04-27 11:45:55,196 INFO L87 Difference]: Start difference. First operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) Second operand 101 states. [2022-04-27 11:45:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:55,199 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2022-04-27 11:45:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 122 transitions. [2022-04-27 11:45:55,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:55,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:55,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:55,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 17 states have call successors, (17), 9 states have call predecessors, (17), 10 states have return successors, (17), 16 states have call predecessors, (17), 15 states have call successors, (17) [2022-04-27 11:45:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2022-04-27 11:45:55,203 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 61 [2022-04-27 11:45:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:55,203 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2022-04-27 11:45:55,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:45:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2022-04-27 11:45:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 11:45:55,204 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:55,204 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:55,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 11:45:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:55,419 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash 645513954, now seen corresponding path program 1 times [2022-04-27 11:45:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857391902] [2022-04-27 11:45:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,493 INFO L290 TraceCheckUtils]: 0: Hoare triple {6114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6067#true} is VALID [2022-04-27 11:45:55,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #122#return; {6067#true} is VALID [2022-04-27 11:45:55,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #98#return; {6067#true} is VALID [2022-04-27 11:45:55,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6067#true} is VALID [2022-04-27 11:45:55,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6067#true} {6067#true} #100#return; {6067#true} is VALID [2022-04-27 11:45:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #116#return; {6067#true} is VALID [2022-04-27 11:45:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #118#return; {6067#true} is VALID [2022-04-27 11:45:55,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #120#return; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L272 TraceCheckUtils]: 1: Hoare triple {6067#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 3: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 4: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6067#true} {6067#true} #116#return; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {6067#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6067#true} {6067#true} #118#return; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L272 TraceCheckUtils]: 11: Hoare triple {6067#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6067#true} #120#return; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,541 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6067#true} {6067#true} #102#return; {6067#true} is VALID [2022-04-27 11:45:55,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {6128#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= 0 finddup_~i~1))} is VALID [2022-04-27 11:45:55,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {6128#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= 0 finddup_~i~1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} assume true; {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,593 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} {6067#true} #104#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:45:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} #106#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 11:45:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:55,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} #108#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {6067#true} call ULTIMATE.init(); {6114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:55,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {6114#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6067#true} is VALID [2022-04-27 11:45:55,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6067#true} {6067#true} #122#return; {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {6067#true} call #t~ret27 := main(); {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {6067#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L272 TraceCheckUtils]: 6: Hoare triple {6067#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6067#true} {6067#true} #98#return; {6067#true} is VALID [2022-04-27 11:45:55,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {6067#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6067#true} is VALID [2022-04-27 11:45:55,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {6067#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {6115#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:55,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6067#true} is VALID [2022-04-27 11:45:55,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,616 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6067#true} {6067#true} #100#return; {6067#true} is VALID [2022-04-27 11:45:55,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {6067#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {6067#true} is VALID [2022-04-27 11:45:55,617 INFO L272 TraceCheckUtils]: 17: Hoare triple {6067#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {6115#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:55,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L272 TraceCheckUtils]: 19: Hoare triple {6067#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6067#true} {6067#true} #116#return; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L272 TraceCheckUtils]: 24: Hoare triple {6067#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6067#true} {6067#true} #118#return; {6067#true} is VALID [2022-04-27 11:45:55,618 INFO L272 TraceCheckUtils]: 29: Hoare triple {6067#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 32: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6067#true} {6067#true} #120#return; {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 34: Hoare triple {6067#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6067#true} {6067#true} #102#return; {6067#true} is VALID [2022-04-27 11:45:55,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {6067#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {6067#true} is VALID [2022-04-27 11:45:55,620 INFO L272 TraceCheckUtils]: 38: Hoare triple {6067#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {6115#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:55,621 INFO L290 TraceCheckUtils]: 39: Hoare triple {6115#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {6128#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= 0 finddup_~i~1))} is VALID [2022-04-27 11:45:55,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {6128#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= 0 finddup_~i~1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,623 INFO L290 TraceCheckUtils]: 42: Hoare triple {6129#(and (= |finddup_#in~_j.base| finddup_~_j.base) (<= 1 finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,623 INFO L290 TraceCheckUtils]: 43: Hoare triple {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} assume true; {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:55,624 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6130#(<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))} {6067#true} #104#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,625 INFO L290 TraceCheckUtils]: 45: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,625 INFO L272 TraceCheckUtils]: 46: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} call __VERIFIER_assert(~r~0); {6067#true} is VALID [2022-04-27 11:45:55,625 INFO L290 TraceCheckUtils]: 47: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,626 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6067#true} {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} #106#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,626 INFO L272 TraceCheckUtils]: 53: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {6067#true} is VALID [2022-04-27 11:45:55,626 INFO L290 TraceCheckUtils]: 54: Hoare triple {6067#true} ~cond := #in~cond; {6067#true} is VALID [2022-04-27 11:45:55,627 INFO L290 TraceCheckUtils]: 55: Hoare triple {6067#true} assume !(0 == ~cond); {6067#true} is VALID [2022-04-27 11:45:55,627 INFO L290 TraceCheckUtils]: 56: Hoare triple {6067#true} assume true; {6067#true} is VALID [2022-04-27 11:45:55,627 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6067#true} {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} #108#return; {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} is VALID [2022-04-27 11:45:55,628 INFO L290 TraceCheckUtils]: 58: Hoare triple {6104#(<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {6113#|main_#t~short20|} is VALID [2022-04-27 11:45:55,628 INFO L290 TraceCheckUtils]: 59: Hoare triple {6113#|main_#t~short20|} assume !#t~short20; {6068#false} is VALID [2022-04-27 11:45:55,628 INFO L272 TraceCheckUtils]: 60: Hoare triple {6068#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {6068#false} is VALID [2022-04-27 11:45:55,628 INFO L290 TraceCheckUtils]: 61: Hoare triple {6068#false} ~cond := #in~cond; {6068#false} is VALID [2022-04-27 11:45:55,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {6068#false} assume 0 == ~cond; {6068#false} is VALID [2022-04-27 11:45:55,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {6068#false} assume !false; {6068#false} is VALID [2022-04-27 11:45:55,629 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:45:55,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:55,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857391902] [2022-04-27 11:45:55,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857391902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:55,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:55,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-27 11:45:55,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176271525] [2022-04-27 11:45:55,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:55,632 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-04-27 11:45:55,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:55,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:55,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:55,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:45:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:45:55,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:45:55,675 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:56,622 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-27 11:45:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:45:56,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-04-27 11:45:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-27 11:45:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:56,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 98 transitions. [2022-04-27 11:45:56,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 98 transitions. [2022-04-27 11:45:56,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:56,718 INFO L225 Difference]: With dead ends: 114 [2022-04-27 11:45:56,718 INFO L226 Difference]: Without dead ends: 103 [2022-04-27 11:45:56,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-27 11:45:56,719 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:56,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 50 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:45:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-27 11:45:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2022-04-27 11:45:56,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:56,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-04-27 11:45:56,814 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-04-27 11:45:56,814 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-04-27 11:45:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:56,817 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 11:45:56,817 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 11:45:56,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:56,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:56,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) Second operand 103 states. [2022-04-27 11:45:56,818 INFO L87 Difference]: Start difference. First operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) Second operand 103 states. [2022-04-27 11:45:56,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:56,821 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-27 11:45:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2022-04-27 11:45:56,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:56,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:56,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:56,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 71 states have internal predecessors, (84), 18 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 17 states have call predecessors, (18), 16 states have call successors, (18) [2022-04-27 11:45:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2022-04-27 11:45:56,824 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 64 [2022-04-27 11:45:56,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:56,825 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2022-04-27 11:45:56,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:56,825 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2022-04-27 11:45:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 11:45:56,825 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:56,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 11:45:56,826 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:56,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:56,826 INFO L85 PathProgramCache]: Analyzing trace with hash 643666912, now seen corresponding path program 1 times [2022-04-27 11:45:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:56,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016990134] [2022-04-27 11:45:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {6700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6651#true} is VALID [2022-04-27 11:45:56,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6651#true} {6651#true} #122#return; {6651#true} is VALID [2022-04-27 11:45:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #98#return; {6651#true} is VALID [2022-04-27 11:45:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6651#true} is VALID [2022-04-27 11:45:56,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6651#true} {6651#true} #100#return; {6651#true} is VALID [2022-04-27 11:45:56,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #116#return; {6651#true} is VALID [2022-04-27 11:45:56,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #118#return; {6651#true} is VALID [2022-04-27 11:45:56,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #120#return; {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L272 TraceCheckUtils]: 1: Hoare triple {6651#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6651#true} {6651#true} #116#return; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {6651#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6651#true} {6651#true} #118#return; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L272 TraceCheckUtils]: 11: Hoare triple {6651#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,914 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6651#true} {6651#true} #120#return; {6651#true} is VALID [2022-04-27 11:45:56,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {6651#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {6651#true} is VALID [2022-04-27 11:45:56,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,915 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6651#true} {6651#true} #102#return; {6651#true} is VALID [2022-04-27 11:45:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {6715#(and (<= (+ finddup_~j~1 1) |finddup_#in~n|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {6715#(and (<= (+ finddup_~j~1 1) |finddup_#in~n|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} is VALID [2022-04-27 11:45:56,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} assume true; {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} is VALID [2022-04-27 11:45:56,967 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} {6651#true} #104#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:45:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} #106#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 11:45:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:56,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} #108#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {6651#true} call ULTIMATE.init(); {6700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:56,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {6700#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6651#true} is VALID [2022-04-27 11:45:56,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6651#true} {6651#true} #122#return; {6651#true} is VALID [2022-04-27 11:45:56,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {6651#true} call #t~ret27 := main(); {6651#true} is VALID [2022-04-27 11:45:56,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {6651#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {6651#true} is VALID [2022-04-27 11:45:56,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {6651#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6651#true} {6651#true} #98#return; {6651#true} is VALID [2022-04-27 11:45:56,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {6651#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {6651#true} is VALID [2022-04-27 11:45:56,978 INFO L272 TraceCheckUtils]: 12: Hoare triple {6651#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {6701#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:56,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {6651#true} is VALID [2022-04-27 11:45:56,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,978 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6651#true} {6651#true} #100#return; {6651#true} is VALID [2022-04-27 11:45:56,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {6651#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L272 TraceCheckUtils]: 17: Hoare triple {6651#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {6701#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:56,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {6651#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6651#true} {6651#true} #116#return; {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L272 TraceCheckUtils]: 24: Hoare triple {6651#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6651#true} {6651#true} #118#return; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L272 TraceCheckUtils]: 29: Hoare triple {6651#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6651#true} {6651#true} #120#return; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {6651#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6651#true} {6651#true} #102#return; {6651#true} is VALID [2022-04-27 11:45:56,980 INFO L290 TraceCheckUtils]: 37: Hoare triple {6651#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {6651#true} is VALID [2022-04-27 11:45:56,982 INFO L272 TraceCheckUtils]: 38: Hoare triple {6651#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {6701#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:56,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {6701#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,983 INFO L290 TraceCheckUtils]: 41: Hoare triple {6714#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= |finddup_#in~n| finddup_~n) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {6715#(and (<= (+ finddup_~j~1 1) |finddup_#in~n|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))} is VALID [2022-04-27 11:45:56,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {6715#(and (<= (+ finddup_~j~1 1) |finddup_#in~n|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} is VALID [2022-04-27 11:45:56,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} assume true; {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} is VALID [2022-04-27 11:45:56,985 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {6716#(<= (+ (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1) |finddup_#in~n|)} {6651#true} #104#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,986 INFO L272 TraceCheckUtils]: 46: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} call __VERIFIER_assert(~r~0); {6651#true} is VALID [2022-04-27 11:45:56,986 INFO L290 TraceCheckUtils]: 47: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,986 INFO L290 TraceCheckUtils]: 48: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,987 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6651#true} {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} #106#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,987 INFO L272 TraceCheckUtils]: 53: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {6651#true} is VALID [2022-04-27 11:45:56,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {6651#true} ~cond := #in~cond; {6651#true} is VALID [2022-04-27 11:45:56,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {6651#true} assume !(0 == ~cond); {6651#true} is VALID [2022-04-27 11:45:56,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {6651#true} assume true; {6651#true} is VALID [2022-04-27 11:45:56,988 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {6651#true} {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} #108#return; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} is VALID [2022-04-27 11:45:56,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {6688#(<= (+ (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) main_~n~0)} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {6697#|main_#t~short20|} is VALID [2022-04-27 11:45:56,989 INFO L272 TraceCheckUtils]: 60: Hoare triple {6697#|main_#t~short20|} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {6698#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:45:56,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {6698#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6699#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:45:56,990 INFO L290 TraceCheckUtils]: 62: Hoare triple {6699#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6652#false} is VALID [2022-04-27 11:45:56,990 INFO L290 TraceCheckUtils]: 63: Hoare triple {6652#false} assume !false; {6652#false} is VALID [2022-04-27 11:45:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:45:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016990134] [2022-04-27 11:45:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016990134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:45:56,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:45:56,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-27 11:45:56,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417229146] [2022-04-27 11:45:56,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:45:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-04-27 11:45:56,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:56,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:57,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:57,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:45:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:45:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:45:57,030 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:58,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,409 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-27 11:45:58,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 11:45:58,409 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 64 [2022-04-27 11:45:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:45:58,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-04-27 11:45:58,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 89 transitions. [2022-04-27 11:45:58,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 89 transitions. [2022-04-27 11:45:58,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:58,493 INFO L225 Difference]: With dead ends: 109 [2022-04-27 11:45:58,493 INFO L226 Difference]: Without dead ends: 107 [2022-04-27 11:45:58,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-04-27 11:45:58,494 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 78 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:45:58,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 56 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-27 11:45:58,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-27 11:45:58,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 103. [2022-04-27 11:45:58,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:45:58,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:45:58,599 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:45:58,599 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:45:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,601 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-04-27 11:45:58,601 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-04-27 11:45:58,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:58,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:58,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) Second operand 107 states. [2022-04-27 11:45:58,602 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) Second operand 107 states. [2022-04-27 11:45:58,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:45:58,604 INFO L93 Difference]: Finished difference Result 107 states and 130 transitions. [2022-04-27 11:45:58,604 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2022-04-27 11:45:58,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:45:58,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:45:58,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:45:58,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:45:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 72 states have (on average 1.2083333333333333) internal successors, (87), 75 states have internal predecessors, (87), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:45:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2022-04-27 11:45:58,607 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 64 [2022-04-27 11:45:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:45:58,607 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2022-04-27 11:45:58,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2022-04-27 11:45:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 11:45:58,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:45:58,608 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:45:58,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 11:45:58,609 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:45:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:45:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2062955389, now seen corresponding path program 1 times [2022-04-27 11:45:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:45:58,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001510057] [2022-04-27 11:45:58,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:45:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:45:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {7297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7250#true} is VALID [2022-04-27 11:45:58,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7250#true} {7250#true} #122#return; {7250#true} is VALID [2022-04-27 11:45:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #98#return; {7250#true} is VALID [2022-04-27 11:45:58,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:45:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7250#true} is VALID [2022-04-27 11:45:58,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7250#true} {7250#true} #100#return; {7250#true} is VALID [2022-04-27 11:45:58,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:45:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:45:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #116#return; {7250#true} is VALID [2022-04-27 11:45:58,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:45:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #118#return; {7250#true} is VALID [2022-04-27 11:45:58,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:45:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #120#return; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L272 TraceCheckUtils]: 1: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7250#true} {7250#true} #116#return; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L272 TraceCheckUtils]: 6: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7250#true} {7250#true} #118#return; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L272 TraceCheckUtils]: 11: Hoare triple {7250#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7250#true} {7250#true} #120#return; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {7250#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7250#true} {7250#true} #102#return; {7250#true} is VALID [2022-04-27 11:45:58,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:45:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {7250#true} is VALID [2022-04-27 11:45:58,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(~j~1 < ~n); {7313#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {7313#(<= finddup_~n (+ finddup_~i~1 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {7314#(<= finddup_~n (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {7314#(<= finddup_~n (+ finddup_~i~1 1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7315#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:45:58,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {7315#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7251#false} is VALID [2022-04-27 11:45:58,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {7251#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {7251#false} is VALID [2022-04-27 11:45:58,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {7251#false} assume true; {7251#false} is VALID [2022-04-27 11:45:58,719 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7251#false} {7250#true} #104#return; {7251#false} is VALID [2022-04-27 11:45:58,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-27 11:45:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7251#false} #106#return; {7251#false} is VALID [2022-04-27 11:45:58,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {7250#true} call ULTIMATE.init(); {7297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:45:58,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {7297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7250#true} is VALID [2022-04-27 11:45:58,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #122#return; {7250#true} is VALID [2022-04-27 11:45:58,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {7250#true} call #t~ret27 := main(); {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {7250#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L272 TraceCheckUtils]: 6: Hoare triple {7250#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7250#true} {7250#true} #98#return; {7250#true} is VALID [2022-04-27 11:45:58,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {7250#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7250#true} is VALID [2022-04-27 11:45:58,725 INFO L272 TraceCheckUtils]: 12: Hoare triple {7250#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {7298#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:58,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7250#true} is VALID [2022-04-27 11:45:58,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,725 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7250#true} {7250#true} #100#return; {7250#true} is VALID [2022-04-27 11:45:58,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {7250#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {7250#true} is VALID [2022-04-27 11:45:58,726 INFO L272 TraceCheckUtils]: 17: Hoare triple {7250#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {7298#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:58,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {7250#true} is VALID [2022-04-27 11:45:58,726 INFO L272 TraceCheckUtils]: 19: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7250#true} {7250#true} #116#return; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L272 TraceCheckUtils]: 24: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7250#true} {7250#true} #118#return; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L272 TraceCheckUtils]: 29: Hoare triple {7250#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7250#true} {7250#true} #120#return; {7250#true} is VALID [2022-04-27 11:45:58,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {7250#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {7250#true} is VALID [2022-04-27 11:45:58,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,728 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7250#true} {7250#true} #102#return; {7250#true} is VALID [2022-04-27 11:45:58,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {7250#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {7250#true} is VALID [2022-04-27 11:45:58,729 INFO L272 TraceCheckUtils]: 38: Hoare triple {7250#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {7298#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:45:58,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {7298#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {7250#true} is VALID [2022-04-27 11:45:58,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {7250#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,730 INFO L290 TraceCheckUtils]: 43: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(~j~1 < ~n); {7313#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {7313#(<= finddup_~n (+ finddup_~i~1 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {7314#(<= finddup_~n (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {7314#(<= finddup_~n (+ finddup_~i~1 1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7315#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:45:58,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7251#false} is VALID [2022-04-27 11:45:58,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {7251#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {7251#false} is VALID [2022-04-27 11:45:58,732 INFO L290 TraceCheckUtils]: 49: Hoare triple {7251#false} assume true; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7251#false} {7250#true} #104#return; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 51: Hoare triple {7251#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L272 TraceCheckUtils]: 52: Hoare triple {7251#false} call __VERIFIER_assert(~r~0); {7250#true} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 53: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 54: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 55: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,733 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7250#true} {7251#false} #106#return; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {7251#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 58: Hoare triple {7251#false} assume !#t~short17; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L272 TraceCheckUtils]: 59: Hoare triple {7251#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 60: Hoare triple {7251#false} ~cond := #in~cond; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 61: Hoare triple {7251#false} assume 0 == ~cond; {7251#false} is VALID [2022-04-27 11:45:58,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {7251#false} assume !false; {7251#false} is VALID [2022-04-27 11:45:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:45:58,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001510057] [2022-04-27 11:45:58,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001510057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:45:58,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280218271] [2022-04-27 11:45:58,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:45:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:45:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:45:58,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:45:58,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 11:45:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 11:45:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:45:58,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:45:58,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {7250#true} call ULTIMATE.init(); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #122#return; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {7250#true} call #t~ret27 := main(); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {7250#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {7250#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7250#true} {7250#true} #98#return; {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {7250#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L272 TraceCheckUtils]: 12: Hoare triple {7250#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {7250#true} is VALID [2022-04-27 11:45:58,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {7250#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7250#true} {7250#true} #100#return; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {7250#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L272 TraceCheckUtils]: 17: Hoare triple {7250#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {7250#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L272 TraceCheckUtils]: 19: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7250#true} {7250#true} #116#return; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L272 TraceCheckUtils]: 24: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7250#true} {7250#true} #118#return; {7250#true} is VALID [2022-04-27 11:45:58,995 INFO L272 TraceCheckUtils]: 29: Hoare triple {7250#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7250#true} {7250#true} #120#return; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {7250#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7250#true} {7250#true} #102#return; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {7250#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L272 TraceCheckUtils]: 38: Hoare triple {7250#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 39: Hoare triple {7250#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {7250#true} is VALID [2022-04-27 11:45:58,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {7250#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(~j~1 < ~n); {7313#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:58,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {7313#(<= finddup_~n (+ finddup_~i~1 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {7314#(<= finddup_~n (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 46: Hoare triple {7314#(<= finddup_~n (+ finddup_~i~1 1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7315#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {7251#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {7251#false} assume true; {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7251#false} {7250#true} #104#return; {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 51: Hoare triple {7251#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L272 TraceCheckUtils]: 52: Hoare triple {7251#false} call __VERIFIER_assert(~r~0); {7251#false} is VALID [2022-04-27 11:45:58,999 INFO L290 TraceCheckUtils]: 53: Hoare triple {7251#false} ~cond := #in~cond; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 54: Hoare triple {7251#false} assume !(0 == ~cond); {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 55: Hoare triple {7251#false} assume true; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7251#false} {7251#false} #106#return; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 57: Hoare triple {7251#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {7251#false} assume !#t~short17; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L272 TraceCheckUtils]: 59: Hoare triple {7251#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 60: Hoare triple {7251#false} ~cond := #in~cond; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 61: Hoare triple {7251#false} assume 0 == ~cond; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L290 TraceCheckUtils]: 62: Hoare triple {7251#false} assume !false; {7251#false} is VALID [2022-04-27 11:45:59,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 11:45:59,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:45:59,203 INFO L290 TraceCheckUtils]: 62: Hoare triple {7251#false} assume !false; {7251#false} is VALID [2022-04-27 11:45:59,203 INFO L290 TraceCheckUtils]: 61: Hoare triple {7251#false} assume 0 == ~cond; {7251#false} is VALID [2022-04-27 11:45:59,203 INFO L290 TraceCheckUtils]: 60: Hoare triple {7251#false} ~cond := #in~cond; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L272 TraceCheckUtils]: 59: Hoare triple {7251#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {7251#false} assume !#t~short17; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {7251#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {7250#true} {7251#false} #106#return; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 55: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:59,204 INFO L272 TraceCheckUtils]: 52: Hoare triple {7251#false} call __VERIFIER_assert(~r~0); {7250#true} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {7251#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7251#false} {7250#true} #104#return; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {7251#false} assume true; {7251#false} is VALID [2022-04-27 11:45:59,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {7251#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {7251#false} is VALID [2022-04-27 11:45:59,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {7315#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7251#false} is VALID [2022-04-27 11:45:59,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {7314#(<= finddup_~n (+ finddup_~i~1 1))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7315#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:45:59,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {7313#(<= finddup_~n (+ finddup_~i~1 2))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {7314#(<= finddup_~n (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:59,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(~j~1 < ~n); {7313#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:59,206 INFO L290 TraceCheckUtils]: 43: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {7312#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:45:59,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:59,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:59,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {7250#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {7311#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:45:59,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {7250#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {7250#true} is VALID [2022-04-27 11:45:59,207 INFO L272 TraceCheckUtils]: 38: Hoare triple {7250#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {7250#true} is VALID [2022-04-27 11:45:59,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {7250#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {7250#true} is VALID [2022-04-27 11:45:59,207 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7250#true} {7250#true} #102#return; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {7250#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7250#true} {7250#true} #120#return; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L272 TraceCheckUtils]: 29: Hoare triple {7250#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7250#true} {7250#true} #118#return; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L272 TraceCheckUtils]: 24: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7250#true} {7250#true} #116#return; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:59,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L272 TraceCheckUtils]: 19: Hoare triple {7250#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {7250#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L272 TraceCheckUtils]: 17: Hoare triple {7250#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {7250#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7250#true} {7250#true} #100#return; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {7250#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L272 TraceCheckUtils]: 12: Hoare triple {7250#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {7250#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7250#true} {7250#true} #98#return; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {7250#true} assume !(0 == ~cond); {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {7250#true} ~cond := #in~cond; {7250#true} is VALID [2022-04-27 11:45:59,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {7250#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {7250#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {7250#true} call #t~ret27 := main(); {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7250#true} {7250#true} #122#return; {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {7250#true} assume true; {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {7250#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {7250#true} call ULTIMATE.init(); {7250#true} is VALID [2022-04-27 11:45:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 11:45:59,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280218271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:45:59,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:45:59,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2022-04-27 11:45:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970318130] [2022-04-27 11:45:59,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:45:59,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2022-04-27 11:45:59,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:45:59,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:45:59,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:45:59,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 11:45:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:45:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 11:45:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:45:59,253 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:46:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:00,029 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2022-04-27 11:46:00,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 11:46:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2022-04-27 11:46:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:46:00,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2022-04-27 11:46:00,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:46:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2022-04-27 11:46:00,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 120 transitions. [2022-04-27 11:46:00,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:00,143 INFO L225 Difference]: With dead ends: 174 [2022-04-27 11:46:00,144 INFO L226 Difference]: Without dead ends: 112 [2022-04-27 11:46:00,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-04-27 11:46:00,145 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 89 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:00,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 54 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 11:46:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-04-27 11:46:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-04-27 11:46:00,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:00,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:46:00,244 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:46:00,244 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:46:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:00,246 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-04-27 11:46:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 11:46:00,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:00,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:00,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) Second operand 112 states. [2022-04-27 11:46:00,247 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) Second operand 112 states. [2022-04-27 11:46:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:00,249 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2022-04-27 11:46:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-04-27 11:46:00,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:00,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:00,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:00,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.173913043478261) internal successors, (81), 72 states have internal predecessors, (81), 19 states have call successors, (19), 10 states have call predecessors, (19), 11 states have return successors, (19), 17 states have call predecessors, (19), 17 states have call successors, (19) [2022-04-27 11:46:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2022-04-27 11:46:00,252 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 63 [2022-04-27 11:46:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:00,252 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2022-04-27 11:46:00,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 4 states have call predecessors, (16), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-04-27 11:46:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2022-04-27 11:46:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-27 11:46:00,253 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:00,253 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:00,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 11:46:00,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:00,454 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -779883059, now seen corresponding path program 2 times [2022-04-27 11:46:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:00,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447420068] [2022-04-27 11:46:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:46:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {8365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8310#true} is VALID [2022-04-27 11:46:00,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8310#true} {8310#true} #122#return; {8310#true} is VALID [2022-04-27 11:46:00,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,548 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #98#return; {8310#true} is VALID [2022-04-27 11:46:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:46:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8310#true} is VALID [2022-04-27 11:46:00,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8310#true} {8310#true} #100#return; {8310#true} is VALID [2022-04-27 11:46:00,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:46:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:46:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #116#return; {8310#true} is VALID [2022-04-27 11:46:00,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #118#return; {8310#true} is VALID [2022-04-27 11:46:00,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:46:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #120#return; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L272 TraceCheckUtils]: 1: Hoare triple {8310#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8310#true} {8310#true} #116#return; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {8310#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8310#true} {8310#true} #118#return; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L272 TraceCheckUtils]: 11: Hoare triple {8310#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8310#true} {8310#true} #120#return; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {8310#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8310#true} {8310#true} #102#return; {8310#true} is VALID [2022-04-27 11:46:00,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:46:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,671 INFO L290 TraceCheckUtils]: 3: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,671 INFO L290 TraceCheckUtils]: 4: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(~j~1 < ~n); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} is VALID [2022-04-27 11:46:00,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} assume true; {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} is VALID [2022-04-27 11:46:00,679 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} {8341#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {8357#(or (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} is VALID [2022-04-27 11:46:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 11:46:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:00,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {8310#true} ~cond := #in~cond; {8382#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:00,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {8382#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:00,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:00,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} {8358#(or (= main_~r~0 0) (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {8363#(<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} is VALID [2022-04-27 11:46:00,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {8310#true} call ULTIMATE.init(); {8365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {8365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8310#true} {8310#true} #122#return; {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {8310#true} call #t~ret27 := main(); {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {8310#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L272 TraceCheckUtils]: 6: Hoare triple {8310#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,709 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8310#true} {8310#true} #98#return; {8310#true} is VALID [2022-04-27 11:46:00,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {8310#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8310#true} is VALID [2022-04-27 11:46:00,709 INFO L272 TraceCheckUtils]: 12: Hoare triple {8310#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {8366#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:00,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8310#true} is VALID [2022-04-27 11:46:00,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,710 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8310#true} {8310#true} #100#return; {8310#true} is VALID [2022-04-27 11:46:00,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {8310#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {8310#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {8366#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L272 TraceCheckUtils]: 19: Hoare triple {8310#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8310#true} {8310#true} #116#return; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L272 TraceCheckUtils]: 24: Hoare triple {8310#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 26: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,711 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8310#true} {8310#true} #118#return; {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L272 TraceCheckUtils]: 29: Hoare triple {8310#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {8310#true} ~cond := #in~cond; {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {8310#true} assume !(0 == ~cond); {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8310#true} {8310#true} #120#return; {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L290 TraceCheckUtils]: 34: Hoare triple {8310#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L290 TraceCheckUtils]: 35: Hoare triple {8310#true} assume true; {8310#true} is VALID [2022-04-27 11:46:00,712 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8310#true} {8310#true} #102#return; {8310#true} is VALID [2022-04-27 11:46:00,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {8310#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {8341#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:46:00,714 INFO L272 TraceCheckUtils]: 38: Hoare triple {8341#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {8366#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:00,714 INFO L290 TraceCheckUtils]: 39: Hoare triple {8366#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,715 INFO L290 TraceCheckUtils]: 40: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,720 INFO L290 TraceCheckUtils]: 47: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !(~j~1 < ~n); {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {8379#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 0 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,721 INFO L290 TraceCheckUtils]: 49: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,722 INFO L290 TraceCheckUtils]: 50: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} is VALID [2022-04-27 11:46:00,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {8380#(and (or (= finddup_~_i.base finddup_~_j.base) (= |finddup_#in~_i.base| finddup_~_i.base)) (<= 1 finddup_~i~1) (= |finddup_#in~_i.offset| finddup_~_i.offset) (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (not (= finddup_~_i.base finddup_~_j.base))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} is VALID [2022-04-27 11:46:00,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} assume true; {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} is VALID [2022-04-27 11:46:00,725 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8381#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (<= 1 (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|)))} {8341#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {8357#(or (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} is VALID [2022-04-27 11:46:00,725 INFO L290 TraceCheckUtils]: 54: Hoare triple {8357#(or (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_#t~ret14| 0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {8358#(or (= main_~r~0 0) (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:00,725 INFO L272 TraceCheckUtils]: 55: Hoare triple {8358#(or (= main_~r~0 0) (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert(~r~0); {8310#true} is VALID [2022-04-27 11:46:00,726 INFO L290 TraceCheckUtils]: 56: Hoare triple {8310#true} ~cond := #in~cond; {8382#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:00,726 INFO L290 TraceCheckUtils]: 57: Hoare triple {8382#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:00,726 INFO L290 TraceCheckUtils]: 58: Hoare triple {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:00,727 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8383#(not (= |__VERIFIER_assert_#in~cond| 0))} {8358#(or (= main_~r~0 0) (<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {8363#(<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} is VALID [2022-04-27 11:46:00,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {8363#(<= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {8364#|main_#t~short17|} is VALID [2022-04-27 11:46:00,728 INFO L290 TraceCheckUtils]: 61: Hoare triple {8364#|main_#t~short17|} assume !#t~short17; {8311#false} is VALID [2022-04-27 11:46:00,728 INFO L272 TraceCheckUtils]: 62: Hoare triple {8311#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {8311#false} is VALID [2022-04-27 11:46:00,728 INFO L290 TraceCheckUtils]: 63: Hoare triple {8311#false} ~cond := #in~cond; {8311#false} is VALID [2022-04-27 11:46:00,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {8311#false} assume 0 == ~cond; {8311#false} is VALID [2022-04-27 11:46:00,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {8311#false} assume !false; {8311#false} is VALID [2022-04-27 11:46:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-27 11:46:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447420068] [2022-04-27 11:46:00,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447420068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:46:00,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:46:00,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-27 11:46:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645191589] [2022-04-27 11:46:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-27 11:46:00,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:00,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:46:00,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:00,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 11:46:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:00,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 11:46:00,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-04-27 11:46:00,781 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:46:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,667 INFO L93 Difference]: Finished difference Result 126 states and 148 transitions. [2022-04-27 11:46:02,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 11:46:02,667 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2022-04-27 11:46:02,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:46:02,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-04-27 11:46:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:46:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2022-04-27 11:46:02,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 109 transitions. [2022-04-27 11:46:02,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:02,768 INFO L225 Difference]: With dead ends: 126 [2022-04-27 11:46:02,768 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 11:46:02,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-04-27 11:46:02,769 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 87 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:02,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 67 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 11:46:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 11:46:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2022-04-27 11:46:02,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:02,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:46:02,869 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:46:02,869 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:46:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,871 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-27 11:46:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-27 11:46:02,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:02,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:02,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Second operand 108 states. [2022-04-27 11:46:02,872 INFO L87 Difference]: Start difference. First operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Second operand 108 states. [2022-04-27 11:46:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:02,875 INFO L93 Difference]: Finished difference Result 108 states and 128 transitions. [2022-04-27 11:46:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-04-27 11:46:02,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:02,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:02,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:02,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 64 states have internal predecessors, (71), 17 states have call successors, (17), 10 states have call predecessors, (17), 10 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:46:02,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-04-27 11:46:02,877 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 66 [2022-04-27 11:46:02,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:02,878 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-04-27 11:46:02,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 11:46:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-04-27 11:46:02,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-27 11:46:02,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:02,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 11:46:02,879 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash 297933182, now seen corresponding path program 1 times [2022-04-27 11:46:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:02,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747598000] [2022-04-27 11:46:02,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:02,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:46:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {8984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8927#true} is VALID [2022-04-27 11:46:03,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8927#true} {8927#true} #122#return; {8927#true} is VALID [2022-04-27 11:46:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,006 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #98#return; {8927#true} is VALID [2022-04-27 11:46:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:46:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8927#true} is VALID [2022-04-27 11:46:03,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8927#true} {8927#true} #100#return; {8927#true} is VALID [2022-04-27 11:46:03,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:46:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:46:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #116#return; {8927#true} is VALID [2022-04-27 11:46:03,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #118#return; {8927#true} is VALID [2022-04-27 11:46:03,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:46:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #120#return; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L272 TraceCheckUtils]: 1: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8927#true} {8927#true} #116#return; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L272 TraceCheckUtils]: 6: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8927#true} {8927#true} #118#return; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L272 TraceCheckUtils]: 11: Hoare triple {8927#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8927#true} {8927#true} #120#return; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {8927#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8927#true} {8927#true} #102#return; {8927#true} is VALID [2022-04-27 11:46:03,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:46:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:46:03,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} assume true; {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:46:03,166 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {8965#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} is VALID [2022-04-27 11:46:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:46:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {9001#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:03,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {9001#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:03,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:03,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} {8966#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 11:46:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #108#return; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 11:46:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {8927#true} call ULTIMATE.init(); {8984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:46:03,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {8984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8927#true} is VALID [2022-04-27 11:46:03,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #122#return; {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {8927#true} call #t~ret27 := main(); {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {8927#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L272 TraceCheckUtils]: 6: Hoare triple {8927#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8927#true} {8927#true} #98#return; {8927#true} is VALID [2022-04-27 11:46:03,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {8927#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8927#true} is VALID [2022-04-27 11:46:03,202 INFO L272 TraceCheckUtils]: 12: Hoare triple {8927#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {8985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:03,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8927#true} is VALID [2022-04-27 11:46:03,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,202 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8927#true} {8927#true} #100#return; {8927#true} is VALID [2022-04-27 11:46:03,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {8927#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L272 TraceCheckUtils]: 17: Hoare triple {8927#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {8985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:03,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L272 TraceCheckUtils]: 19: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8927#true} {8927#true} #116#return; {8927#true} is VALID [2022-04-27 11:46:03,203 INFO L272 TraceCheckUtils]: 24: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8927#true} {8927#true} #118#return; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L272 TraceCheckUtils]: 29: Hoare triple {8927#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8927#true} {8927#true} #120#return; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 34: Hoare triple {8927#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,204 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8927#true} {8927#true} #102#return; {8927#true} is VALID [2022-04-27 11:46:03,205 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:46:03,206 INFO L272 TraceCheckUtils]: 38: Hoare triple {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {8985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:03,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {8985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:03,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {8999#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:46:03,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} assume true; {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:46:03,210 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9000#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 1 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {8965#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} is VALID [2022-04-27 11:46:03,210 INFO L290 TraceCheckUtils]: 45: Hoare triple {8965#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {8966#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} is VALID [2022-04-27 11:46:03,210 INFO L272 TraceCheckUtils]: 46: Hoare triple {8966#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} call __VERIFIER_assert(~r~0); {8927#true} is VALID [2022-04-27 11:46:03,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {8927#true} ~cond := #in~cond; {9001#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:03,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {9001#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:03,211 INFO L290 TraceCheckUtils]: 49: Hoare triple {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:03,212 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} {8966#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,212 INFO L290 TraceCheckUtils]: 51: Hoare triple {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,213 INFO L272 TraceCheckUtils]: 53: Hoare triple {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,213 INFO L290 TraceCheckUtils]: 54: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,213 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8927#true} {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #108#return; {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {8971#(and (<= 1 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,214 INFO L272 TraceCheckUtils]: 60: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:03,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:03,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:03,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:03,215 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8927#true} {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:03,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {8981#(not (= |main_#t~mem22| |main_#t~mem21|))} is VALID [2022-04-27 11:46:03,216 INFO L272 TraceCheckUtils]: 66: Hoare triple {8981#(not (= |main_#t~mem22| |main_#t~mem21|))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:46:03,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {8982#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8983#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:46:03,217 INFO L290 TraceCheckUtils]: 68: Hoare triple {8983#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8928#false} is VALID [2022-04-27 11:46:03,217 INFO L290 TraceCheckUtils]: 69: Hoare triple {8928#false} assume !false; {8928#false} is VALID [2022-04-27 11:46:03,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:46:03,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:03,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747598000] [2022-04-27 11:46:03,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747598000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:46:03,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481548069] [2022-04-27 11:46:03,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:03,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:03,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:03,220 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:46:03,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 11:46:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-27 11:46:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:03,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:03,384 INFO L390 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 10 treesize of output 8 [2022-04-27 11:46:03,506 INFO L356 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-04-27 11:46:03,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-04-27 11:46:03,532 INFO L356 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-04-27 11:46:03,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-04-27 11:46:03,547 INFO L390 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 [2022-04-27 11:46:03,558 INFO L390 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 17 treesize of output 6 [2022-04-27 11:46:03,672 INFO L390 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 18 treesize of output 14 [2022-04-27 11:46:03,734 INFO L390 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 11 treesize of output 10 [2022-04-27 11:46:03,768 INFO L390 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 [2022-04-27 11:46:05,311 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 11:46:05,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 28 [2022-04-27 11:46:05,322 INFO L390 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 20 [2022-04-27 11:46:05,407 INFO L272 TraceCheckUtils]: 0: Hoare triple {8927#true} call ULTIMATE.init(); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #122#return; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {8927#true} call #t~ret27 := main(); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {8927#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L272 TraceCheckUtils]: 6: Hoare triple {8927#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8927#true} {8927#true} #98#return; {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {8927#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8927#true} is VALID [2022-04-27 11:46:05,407 INFO L272 TraceCheckUtils]: 12: Hoare triple {8927#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {8927#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8927#true} {8927#true} #100#return; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {8927#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L272 TraceCheckUtils]: 17: Hoare triple {8927#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {8927#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L272 TraceCheckUtils]: 19: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8927#true} {8927#true} #116#return; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L272 TraceCheckUtils]: 24: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:05,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8927#true} {8927#true} #118#return; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L272 TraceCheckUtils]: 29: Hoare triple {8927#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8927#true} {8927#true} #120#return; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {8927#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:05,409 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8927#true} {8927#true} #102#return; {8927#true} is VALID [2022-04-27 11:46:05,410 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {9116#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:46:05,410 INFO L272 TraceCheckUtils]: 38: Hoare triple {9116#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {8927#true} is VALID [2022-04-27 11:46:05,410 INFO L290 TraceCheckUtils]: 39: Hoare triple {8927#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:05,410 INFO L290 TraceCheckUtils]: 40: Hoare triple {8998#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {9126#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:05,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {9126#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {9126#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:46:05,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {9126#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {9133#(or (and (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |finddup_#in~_j.offset|) 1) (= (select (select (store |#memory_int| |finddup_#in~_j.base| v_DerPreprocessor_1) |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)))} is VALID [2022-04-27 11:46:05,416 INFO L290 TraceCheckUtils]: 43: Hoare triple {9133#(or (and (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |finddup_#in~_j.offset|) 1) (= (select (select (store |#memory_int| |finddup_#in~_j.base| v_DerPreprocessor_1) |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)))} assume true; {9133#(or (and (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |finddup_#in~_j.offset|) 1) (= (select (select (store |#memory_int| |finddup_#in~_j.base| v_DerPreprocessor_1) |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)))} is VALID [2022-04-27 11:46:05,418 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9133#(or (and (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |finddup_#in~_j.offset|) 1) (= (select (select (store |#memory_int| |finddup_#in~_j.base| v_DerPreprocessor_1) |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0))) (= (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 1)))} {9116#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,420 INFO L272 TraceCheckUtils]: 46: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert(~r~0); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} ~cond := #in~cond; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume !(0 == ~cond); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume true; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,422 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} #106#return; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,423 INFO L290 TraceCheckUtils]: 51: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,424 INFO L290 TraceCheckUtils]: 52: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,425 INFO L272 TraceCheckUtils]: 53: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} ~cond := #in~cond; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume !(0 == ~cond); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume true; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,427 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} #108#return; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,428 INFO L290 TraceCheckUtils]: 59: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,430 INFO L272 TraceCheckUtils]: 60: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} ~cond := #in~cond; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume !(0 == ~cond); {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} assume true; {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} is VALID [2022-04-27 11:46:05,437 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {9147#(exists ((v_DerPreprocessor_1 (Array Int Int)) (|v_main_~#i~2.base_BEFORE_CALL_4| Int) (|v_main_~#j~2.base_BEFORE_CALL_3| Int)) (and (= (select (select (store |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3| v_DerPreprocessor_1) |v_main_~#i~2.base_BEFORE_CALL_4|) 0) 0) (= (select v_DerPreprocessor_1 0) 1) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_3|) 0) 1)))} {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} #110#return; {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:46:05,438 INFO L290 TraceCheckUtils]: 65: Hoare triple {9140#(and (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= |main_~#j~2.offset| 0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (and (= (select v_DerPreprocessor_1 |main_~#j~2.offset|) 1) (= (select (select (store |#memory_int| |main_~#j~2.base| v_DerPreprocessor_1) |main_~#i~2.base|) |main_~#i~2.offset|) 0))) (= |main_~#i~2.offset| 0))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {9205#(and (= |main_#t~mem22| 1) (= |main_#t~mem21| 0))} is VALID [2022-04-27 11:46:05,438 INFO L272 TraceCheckUtils]: 66: Hoare triple {9205#(and (= |main_#t~mem22| 1) (= |main_#t~mem21| 0))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {9209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:05,438 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:05,439 INFO L290 TraceCheckUtils]: 68: Hoare triple {9213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8928#false} is VALID [2022-04-27 11:46:05,439 INFO L290 TraceCheckUtils]: 69: Hoare triple {8928#false} assume !false; {8928#false} is VALID [2022-04-27 11:46:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:46:05,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:46:05,664 INFO L356 Elim1Store]: treesize reduction 28, result has 33.3 percent of original size [2022-04-27 11:46:05,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 52 [2022-04-27 11:46:05,669 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:05,669 INFO L390 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 1 case distinctions, treesize of input 38 treesize of output 42 [2022-04-27 11:46:05,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:05,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 67 [2022-04-27 11:46:05,687 INFO L390 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 87 treesize of output 75 [2022-04-27 11:46:05,692 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-27 11:46:05,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2022-04-27 11:46:05,739 INFO L390 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 20 treesize of output 18 [2022-04-27 11:46:05,821 INFO L356 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-04-27 11:46:05,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 87 [2022-04-27 11:46:05,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:05,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 195 treesize of output 215 [2022-04-27 11:46:05,898 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:05,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 216 [2022-04-27 11:46:06,001 INFO L390 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 8 treesize of output 6 [2022-04-27 11:46:06,011 INFO L390 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 6 treesize of output 4 [2022-04-27 11:46:06,018 INFO L390 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 6 treesize of output 4 [2022-04-27 11:46:06,029 INFO L390 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 8 treesize of output 6 [2022-04-27 11:46:06,042 INFO L390 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 11 treesize of output 9 [2022-04-27 11:46:06,234 INFO L390 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 6 treesize of output 4 [2022-04-27 11:46:06,245 INFO L390 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 11 treesize of output 9 [2022-04-27 11:46:06,254 INFO L390 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 11 treesize of output 9 [2022-04-27 11:46:06,344 INFO L390 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 30 treesize of output 28 [2022-04-27 11:46:06,360 INFO L390 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 30 treesize of output 28 [2022-04-27 11:46:06,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:06,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-04-27 11:46:06,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-27 11:46:06,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-04-27 11:46:06,766 INFO L290 TraceCheckUtils]: 69: Hoare triple {8928#false} assume !false; {8928#false} is VALID [2022-04-27 11:46:06,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {9213#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8928#false} is VALID [2022-04-27 11:46:06,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {9209#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9213#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:46:06,768 INFO L272 TraceCheckUtils]: 66: Hoare triple {8981#(not (= |main_#t~mem22| |main_#t~mem21|))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {9209#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:46:06,769 INFO L290 TraceCheckUtils]: 65: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {8981#(not (= |main_#t~mem22| |main_#t~mem21|))} is VALID [2022-04-27 11:46:06,769 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8927#true} {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,770 INFO L272 TraceCheckUtils]: 60: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,770 INFO L290 TraceCheckUtils]: 59: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,772 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {8927#true} {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #108#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,772 INFO L272 TraceCheckUtils]: 53: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,774 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8927#true} {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,774 INFO L290 TraceCheckUtils]: 48: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,774 INFO L290 TraceCheckUtils]: 47: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,774 INFO L272 TraceCheckUtils]: 46: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert(~r~0); {8927#true} is VALID [2022-04-27 11:46:06,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,776 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {9298#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (= |finddup_#in~_i.base| |finddup_#in~_j.base|))} {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {8976#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:46:06,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {9298#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (= |finddup_#in~_i.base| |finddup_#in~_j.base|))} assume true; {9298#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (= |finddup_#in~_i.base| |finddup_#in~_j.base|))} is VALID [2022-04-27 11:46:06,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {9305#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= |finddup_#in~_j.base| finddup_~_j.base) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {9298#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (= |finddup_#in~_i.base| |finddup_#in~_j.base|))} is VALID [2022-04-27 11:46:06,779 INFO L290 TraceCheckUtils]: 41: Hoare triple {9305#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= |finddup_#in~_j.base| finddup_~_j.base) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {9305#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= |finddup_#in~_j.base| finddup_~_j.base) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))))))} is VALID [2022-04-27 11:46:06,780 INFO L290 TraceCheckUtils]: 40: Hoare triple {9312#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)) (= |finddup_#in~_j.base| finddup_~_j.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {9305#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= |finddup_#in~_j.base| finddup_~_j.base) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))))))} is VALID [2022-04-27 11:46:06,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {8927#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {9312#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (and (or (= |finddup_#in~_i.base| finddup_~_j.base) (and (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)) (= |finddup_#in~_j.base| finddup_~_j.base))))} is VALID [2022-04-27 11:46:06,781 INFO L272 TraceCheckUtils]: 38: Hoare triple {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {8927#true} is VALID [2022-04-27 11:46:06,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {8927#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {8958#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:46:06,781 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8927#true} {8927#true} #102#return; {8927#true} is VALID [2022-04-27 11:46:06,781 INFO L290 TraceCheckUtils]: 35: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,781 INFO L290 TraceCheckUtils]: 34: Hoare triple {8927#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {8927#true} is VALID [2022-04-27 11:46:06,781 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8927#true} {8927#true} #120#return; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 30: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L272 TraceCheckUtils]: 29: Hoare triple {8927#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8927#true} {8927#true} #118#return; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 26: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8927#true} {8927#true} #116#return; {8927#true} is VALID [2022-04-27 11:46:06,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L272 TraceCheckUtils]: 19: Hoare triple {8927#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {8927#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L272 TraceCheckUtils]: 17: Hoare triple {8927#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {8927#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8927#true} {8927#true} #100#return; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {8927#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L272 TraceCheckUtils]: 12: Hoare triple {8927#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {8927#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {8927#true} is VALID [2022-04-27 11:46:06,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8927#true} {8927#true} #98#return; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {8927#true} assume !(0 == ~cond); {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {8927#true} ~cond := #in~cond; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {8927#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {8927#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {8927#true} call #t~ret27 := main(); {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8927#true} {8927#true} #122#return; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {8927#true} assume true; {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {8927#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8927#true} is VALID [2022-04-27 11:46:06,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {8927#true} call ULTIMATE.init(); {8927#true} is VALID [2022-04-27 11:46:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:46:06,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481548069] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:46:06,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:46:06,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [16, 11] total 27 [2022-04-27 11:46:06,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087421214] [2022-04-27 11:46:06,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:46:06,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-04-27 11:46:06,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:06,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 11:46:06,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 11:46:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 11:46:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=621, Unknown=4, NotChecked=0, Total=702 [2022-04-27 11:46:06,839 INFO L87 Difference]: Start difference. First operand 90 states and 104 transitions. Second operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 11:46:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:07,516 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2022-04-27 11:46:07,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 11:46:07,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 70 [2022-04-27 11:46:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 11:46:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-27 11:46:07,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 11:46:07,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2022-04-27 11:46:07,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 94 transitions. [2022-04-27 11:46:07,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:07,596 INFO L225 Difference]: With dead ends: 110 [2022-04-27 11:46:07,596 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 11:46:07,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=827, Unknown=4, NotChecked=0, Total=930 [2022-04-27 11:46:07,597 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 36 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:46:07,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 455 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:46:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 11:46:07,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2022-04-27 11:46:07,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:46:07,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:46:07,708 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:46:07,708 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:46:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:07,711 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2022-04-27 11:46:07,711 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2022-04-27 11:46:07,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:07,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:07,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 108 states. [2022-04-27 11:46:07,712 INFO L87 Difference]: Start difference. First operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 108 states. [2022-04-27 11:46:07,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:07,714 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2022-04-27 11:46:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2022-04-27 11:46:07,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:46:07,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:46:07,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:46:07,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:46:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.125) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:46:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-04-27 11:46:07,718 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 70 [2022-04-27 11:46:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:46:07,718 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-04-27 11:46:07,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.875) internal successors, (31), 9 states have internal predecessors, (31), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-27 11:46:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-04-27 11:46:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-27 11:46:07,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:46:07,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:46:07,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-27 11:46:07,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-27 11:46:07,943 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:46:07,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:46:07,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1867983073, now seen corresponding path program 4 times [2022-04-27 11:46:07,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:46:07,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146969762] [2022-04-27 11:46:07,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:46:07,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:46:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:08,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:46:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:08,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {10014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9957#true} is VALID [2022-04-27 11:46:08,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:08,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9957#true} {9957#true} #122#return; {9957#true} is VALID [2022-04-27 11:46:08,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:08,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:08,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:08,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:08,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9957#true} {9957#true} #98#return; {9957#true} is VALID [2022-04-27 11:46:08,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:46:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:08,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:08,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:08,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {9957#true} #100#return; {9969#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:46:08,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:46:08,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:09,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:46:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:09,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:09,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:09,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:09,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:09,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:46:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:09,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:09,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:09,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:09,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:46:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:09,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:09,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:09,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:09,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {10030#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:46:09,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:09,458 INFO L272 TraceCheckUtils]: 1: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:09,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:09,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:09,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:09,460 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:09,460 INFO L272 TraceCheckUtils]: 6: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:09,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:09,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:09,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:09,461 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:09,461 INFO L272 TraceCheckUtils]: 11: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:09,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:09,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:09,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:09,462 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {10030#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:46:09,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {10030#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:46:09,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:46:09,468 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:46:09,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:46:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:11,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {10034#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:46:11,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {10034#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10035#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:46:11,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {10035#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10036#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (or (and (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:46:11,893 INFO L290 TraceCheckUtils]: 3: Hoare triple {10036#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (or (and (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10037#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:46:11,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {10037#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10038#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= 2 finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:46:11,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {10038#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= 2 finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10039#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:46:11,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {10039#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10040#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:46:11,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {10040#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:46:11,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} assume !(~j~1 < ~n); {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:46:11,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10042#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (<= 3 finddup_~n))} is VALID [2022-04-27 11:46:11,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {10042#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (<= 3 finddup_~n))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10043#(and (or (not (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))) (<= 3 finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))))} is VALID [2022-04-27 11:46:11,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {10043#(and (or (not (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))) (<= 3 finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10044#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= |finddup_#t~mem11| |finddup_#t~mem10|) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (= finddup_~j~1 0) (<= 3 finddup_~n)))} is VALID [2022-04-27 11:46:11,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {10044#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= |finddup_#t~mem11| |finddup_#t~mem10|) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (= finddup_~j~1 0) (<= 3 finddup_~n)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10045#(or (and (= finddup_~j~1 0) (<= 3 finddup_~n)) (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:46:11,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {10045#(or (and (= finddup_~j~1 0) (<= 3 finddup_~n)) (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10046#(or (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ finddup_~j~1 1) finddup_~n))} is VALID [2022-04-27 11:46:11,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {10046#(or (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ finddup_~j~1 1) finddup_~n))} assume !(~j~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !(~j~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !(~i~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #res := 0; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume true; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,921 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} #104#return; {9958#false} is VALID [2022-04-27 11:46:11,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {9957#true} call ULTIMATE.init(); {10014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:46:11,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {10014#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9957#true} is VALID [2022-04-27 11:46:11,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:11,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9957#true} {9957#true} #122#return; {9957#true} is VALID [2022-04-27 11:46:11,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {9957#true} call #t~ret27 := main(); {9957#true} is VALID [2022-04-27 11:46:11,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {9957#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {9957#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9957#true} {9957#true} #98#return; {9957#true} is VALID [2022-04-27 11:46:11,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {9957#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9957#true} is VALID [2022-04-27 11:46:11,928 INFO L272 TraceCheckUtils]: 12: Hoare triple {9957#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:11,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:11,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:11,930 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {9957#true} #100#return; {9969#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:46:11,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {9969#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:46:11,931 INFO L272 TraceCheckUtils]: 17: Hoare triple {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:11,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:11,932 INFO L272 TraceCheckUtils]: 19: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:11,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:11,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:11,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:11,933 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:11,933 INFO L272 TraceCheckUtils]: 24: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:11,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:11,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:11,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:11,934 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9957#true} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:46:11,934 INFO L272 TraceCheckUtils]: 29: Hoare triple {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:11,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:11,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:11,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:11,937 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10017#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {10030#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} is VALID [2022-04-27 11:46:11,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {10030#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (* mkdup_~j~0 4) (* mkdup_~i~0 4))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:46:11,942 INFO L290 TraceCheckUtils]: 35: Hoare triple {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:46:11,946 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10031#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:46:11,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:46:11,949 INFO L272 TraceCheckUtils]: 38: Hoare triple {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:11,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {10034#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:46:11,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {10034#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10035#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:46:11,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {10035#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10036#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (or (and (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:46:11,953 INFO L290 TraceCheckUtils]: 42: Hoare triple {10036#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (or (and (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10037#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:46:11,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {10037#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10038#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= 2 finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:46:11,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {10038#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= 2 finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10039#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:46:11,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {10039#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10040#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:46:11,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {10040#(and (= (* finddup_~i~1 4) 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= 3 finddup_~n) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:46:11,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} assume !(~j~1 < ~n); {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:46:11,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {10041#(and (= (* finddup_~i~1 4) 0) (<= 3 finddup_~n) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (= (+ finddup_~a.offset (* finddup_~i~1 4) 8) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~i~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) (= (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (+ finddup_~a.offset (* finddup_~i~1 4) 8))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10042#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (<= 3 finddup_~n))} is VALID [2022-04-27 11:46:11,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {10042#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (<= 3 finddup_~n))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10043#(and (or (not (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))) (<= 3 finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))))} is VALID [2022-04-27 11:46:11,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {10043#(and (or (not (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))) (<= 3 finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (= finddup_~a.offset (+ finddup_~a.offset (* finddup_~j~1 4)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10044#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= |finddup_#t~mem11| |finddup_#t~mem10|) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (= finddup_~j~1 0) (<= 3 finddup_~n)))} is VALID [2022-04-27 11:46:11,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {10044#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (= |finddup_#t~mem11| |finddup_#t~mem10|) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (= finddup_~j~1 0) (<= 3 finddup_~n)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10045#(or (and (= finddup_~j~1 0) (<= 3 finddup_~n)) (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:46:11,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {10045#(or (and (= finddup_~j~1 0) (<= 3 finddup_~n)) (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10046#(or (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ finddup_~j~1 1) finddup_~n))} is VALID [2022-04-27 11:46:11,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {10046#(or (and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (<= (+ finddup_~j~1 1) finddup_~n))} assume !(~j~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,981 INFO L290 TraceCheckUtils]: 56: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !(~j~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,982 INFO L290 TraceCheckUtils]: 57: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,983 INFO L290 TraceCheckUtils]: 58: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume !(~i~1 < ~n); {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,984 INFO L290 TraceCheckUtils]: 59: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} #res := 0; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,984 INFO L290 TraceCheckUtils]: 60: Hoare triple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} assume true; {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} is VALID [2022-04-27 11:46:11,986 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10047#(and (or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))} {9990#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} #104#return; {9958#false} is VALID [2022-04-27 11:46:11,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {9958#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {9958#false} is VALID [2022-04-27 11:46:11,986 INFO L272 TraceCheckUtils]: 63: Hoare triple {9958#false} call __VERIFIER_assert(~r~0); {9958#false} is VALID [2022-04-27 11:46:11,987 INFO L290 TraceCheckUtils]: 64: Hoare triple {9958#false} ~cond := #in~cond; {9958#false} is VALID [2022-04-27 11:46:11,987 INFO L290 TraceCheckUtils]: 65: Hoare triple {9958#false} assume 0 == ~cond; {9958#false} is VALID [2022-04-27 11:46:11,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {9958#false} assume !false; {9958#false} is VALID [2022-04-27 11:46:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-27 11:46:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:46:11,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146969762] [2022-04-27 11:46:11,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146969762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:46:11,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313948721] [2022-04-27 11:46:11,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 11:46:11,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:46:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:46:11,989 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:46:11,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-27 11:46:12,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 11:46:12,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:46:12,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-27 11:46:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:46:12,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:46:12,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-04-27 11:46:15,716 INFO L390 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 29 treesize of output 24 [2022-04-27 11:46:17,029 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 c_main_~n~0) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (< mkdup_~j~0 c_main_~n~0) (<= 0 mkdup_~i~0) (= (store (store ((as const (Array Int Int)) 0) (+ c_main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) c_main_~a~0.offset) mkdup_~x~0) (select |c_#memory_int| c_main_~a~0.base)))) is different from true [2022-04-27 11:46:20,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {9957#true} call ULTIMATE.init(); {9957#true} is VALID [2022-04-27 11:46:20,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {9957#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9957#true} {9957#true} #122#return; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {9957#true} call #t~ret27 := main(); {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {9957#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L272 TraceCheckUtils]: 6: Hoare triple {9957#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {9957#true} ~cond := #in~cond; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {9957#true} assume !(0 == ~cond); {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {9957#true} assume true; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9957#true} {9957#true} #98#return; {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {9957#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {9957#true} is VALID [2022-04-27 11:46:20,904 INFO L272 TraceCheckUtils]: 12: Hoare triple {9957#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {9957#true} is VALID [2022-04-27 11:46:20,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {9957#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:20,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:46:20,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10016#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {9957#true} #100#return; {9969#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:46:20,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {9969#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:46:20,910 INFO L272 TraceCheckUtils]: 17: Hoare triple {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:20,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {10105#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:46:20,910 INFO L272 TraceCheckUtils]: 19: Hoare triple {10105#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:20,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:20,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,912 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10105#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {10121#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:46:20,912 INFO L272 TraceCheckUtils]: 24: Hoare triple {10121#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:20,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:20,913 INFO L290 TraceCheckUtils]: 26: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,914 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10121#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {10137#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:46:20,914 INFO L272 TraceCheckUtils]: 29: Hoare triple {10137#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {9957#true} is VALID [2022-04-27 11:46:20,915 INFO L290 TraceCheckUtils]: 30: Hoare triple {9957#true} ~cond := #in~cond; {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:46:20,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {10032#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {10033#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:46:20,916 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10033#(not (= |assume_abort_if_not_#in~cond| 0))} {10137#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} #120#return; {10153#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:46:22,920 WARN L290 TraceCheckUtils]: 34: Hoare triple {10153#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {10157#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:46:24,146 WARN L290 TraceCheckUtils]: 35: Hoare triple {10157#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} assume true; {10157#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:46:25,347 WARN L284 TraceCheckUtils]: 36: Hoare quadruple {10157#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} {9970#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {10164#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:46:27,037 WARN L290 TraceCheckUtils]: 37: Hoare triple {10164#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {10164#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:46:27,038 INFO L272 TraceCheckUtils]: 38: Hoare triple {10164#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {10015#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:46:27,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {10015#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {10174#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:46:27,039 INFO L290 TraceCheckUtils]: 40: Hoare triple {10174#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10178#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:46:27,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {10178#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10182#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} is VALID [2022-04-27 11:46:27,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {10182#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10186#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:46:27,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {10186#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10190#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:46:27,043 INFO L290 TraceCheckUtils]: 44: Hoare triple {10190#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10194#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:46:27,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {10194#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10198#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:46:27,044 INFO L290 TraceCheckUtils]: 46: Hoare triple {10198#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10202#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:46:27,045 INFO L290 TraceCheckUtils]: 47: Hoare triple {10202#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} assume !(~j~1 < ~n); {10206#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 3)))} is VALID [2022-04-27 11:46:27,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {10206#(and (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 3)))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10210#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 2)) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:46:27,046 INFO L290 TraceCheckUtils]: 49: Hoare triple {10210#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 2)) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10214#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 2)) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:46:27,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {10214#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 2)) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {10218#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) |finddup_#t~mem11|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))))} is VALID [2022-04-27 11:46:27,053 INFO L290 TraceCheckUtils]: 51: Hoare triple {10218#(and (= |#memory_int| |old(#memory_int)|) (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) |finddup_#t~mem11|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,059 INFO L290 TraceCheckUtils]: 52: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,069 INFO L290 TraceCheckUtils]: 53: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} assume !(~j~1 < ~n); {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,082 INFO L290 TraceCheckUtils]: 55: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} assume !(~j~1 < ~n); {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} assume !(~i~1 < ~n); {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} #res := 0; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,122 INFO L290 TraceCheckUtils]: 60: Hoare triple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} assume true; {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} is VALID [2022-04-27 11:46:27,125 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {10222#(and (exists ((finddup_~i~1 Int)) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4) 4)))))) (= |#memory_int| |old(#memory_int)|))} {10164#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} #104#return; {9958#false} is VALID [2022-04-27 11:46:27,125 INFO L290 TraceCheckUtils]: 62: Hoare triple {9958#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {9958#false} is VALID [2022-04-27 11:46:27,125 INFO L272 TraceCheckUtils]: 63: Hoare triple {9958#false} call __VERIFIER_assert(~r~0); {9958#false} is VALID [2022-04-27 11:46:27,125 INFO L290 TraceCheckUtils]: 64: Hoare triple {9958#false} ~cond := #in~cond; {9958#false} is VALID [2022-04-27 11:46:27,125 INFO L290 TraceCheckUtils]: 65: Hoare triple {9958#false} assume 0 == ~cond; {9958#false} is VALID [2022-04-27 11:46:27,125 INFO L290 TraceCheckUtils]: 66: Hoare triple {9958#false} assume !false; {9958#false} is VALID [2022-04-27 11:46:27,126 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:46:27,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:46:27,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313948721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:46:27,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:46:27,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-04-27 11:46:27,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246318445] [2022-04-27 11:46:27,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:46:27,742 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 67 [2022-04-27 11:46:27,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:46:27,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 11:46:33,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 93 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:46:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-27 11:46:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:46:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-27 11:46:33,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1880, Unknown=4, NotChecked=88, Total=2162 [2022-04-27 11:46:33,550 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 11:46:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:46:55,972 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2022-04-27 11:46:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-27 11:46:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) Word has length 67 [2022-04-27 11:46:55,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:46:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 11:46:55,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 160 transitions. [2022-04-27 11:46:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 11:46:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 160 transitions. [2022-04-27 11:46:55,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 160 transitions. [2022-04-27 11:47:01,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 156 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:01,607 INFO L225 Difference]: With dead ends: 187 [2022-04-27 11:47:01,607 INFO L226 Difference]: Without dead ends: 153 [2022-04-27 11:47:01,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=612, Invalid=6186, Unknown=12, NotChecked=162, Total=6972 [2022-04-27 11:47:01,609 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 164 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 306 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:01,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 225 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1663 Invalid, 0 Unknown, 306 Unchecked, 2.3s Time] [2022-04-27 11:47:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-27 11:47:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 115. [2022-04-27 11:47:01,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:01,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:47:01,745 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:47:01,745 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:47:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:01,748 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2022-04-27 11:47:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2022-04-27 11:47:01,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:01,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:01,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 153 states. [2022-04-27 11:47:01,749 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 153 states. [2022-04-27 11:47:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:01,752 INFO L93 Difference]: Finished difference Result 153 states and 185 transitions. [2022-04-27 11:47:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 185 transitions. [2022-04-27 11:47:01,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:01,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:01,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:01,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 84 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:47:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2022-04-27 11:47:01,756 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 67 [2022-04-27 11:47:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:01,756 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2022-04-27 11:47:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 39 states have internal predecessors, (68), 9 states have call successors, (16), 4 states have call predecessors, (16), 7 states have return successors, (13), 10 states have call predecessors, (13), 8 states have call successors, (13) [2022-04-27 11:47:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2022-04-27 11:47:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-27 11:47:01,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:01,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:01,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-27 11:47:01,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-27 11:47:01,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:01,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1243098892, now seen corresponding path program 1 times [2022-04-27 11:47:01,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:01,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642570451] [2022-04-27 11:47:01,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:01,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:47:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {11145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11085#true} is VALID [2022-04-27 11:47:02,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,106 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11085#true} {11085#true} #122#return; {11085#true} is VALID [2022-04-27 11:47:02,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:47:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #98#return; {11085#true} is VALID [2022-04-27 11:47:02,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:47:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11085#true} is VALID [2022-04-27 11:47:02,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11085#true} {11085#true} #100#return; {11085#true} is VALID [2022-04-27 11:47:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:47:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:47:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #116#return; {11085#true} is VALID [2022-04-27 11:47:02,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:47:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #118#return; {11085#true} is VALID [2022-04-27 11:47:02,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:47:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #120#return; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L272 TraceCheckUtils]: 1: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11085#true} {11085#true} #116#return; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L272 TraceCheckUtils]: 6: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11085#true} {11085#true} #118#return; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {11085#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11085#true} {11085#true} #120#return; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {11085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11085#true} {11085#true} #102#return; {11085#true} is VALID [2022-04-27 11:47:02,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:47:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:47:02,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} assume true; {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:47:02,302 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} {11116#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {11126#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 11:47:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11163#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:02,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {11163#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:02,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:02,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} {11127#(and (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-27 11:47:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} #108#return; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-04-27 11:47:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:02,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {11085#true} call ULTIMATE.init(); {11145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:47:02,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {11145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #122#return; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {11085#true} call #t~ret27 := main(); {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {11085#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {11085#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11085#true} {11085#true} #98#return; {11085#true} is VALID [2022-04-27 11:47:02,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {11085#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11085#true} is VALID [2022-04-27 11:47:02,331 INFO L272 TraceCheckUtils]: 12: Hoare triple {11085#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {11146#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:02,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11085#true} is VALID [2022-04-27 11:47:02,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,331 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11085#true} {11085#true} #100#return; {11085#true} is VALID [2022-04-27 11:47:02,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {11085#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {11085#true} is VALID [2022-04-27 11:47:02,332 INFO L272 TraceCheckUtils]: 17: Hoare triple {11085#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {11146#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:02,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {11085#true} is VALID [2022-04-27 11:47:02,332 INFO L272 TraceCheckUtils]: 19: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11085#true} {11085#true} #116#return; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L272 TraceCheckUtils]: 24: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11085#true} {11085#true} #118#return; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L272 TraceCheckUtils]: 29: Hoare triple {11085#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,333 INFO L290 TraceCheckUtils]: 32: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,334 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11085#true} {11085#true} #120#return; {11085#true} is VALID [2022-04-27 11:47:02,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {11085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {11085#true} is VALID [2022-04-27 11:47:02,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,334 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11085#true} {11085#true} #102#return; {11085#true} is VALID [2022-04-27 11:47:02,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {11085#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {11116#(not (= |main_~#i~2.base| |main_~#j~2.base|))} is VALID [2022-04-27 11:47:02,336 INFO L272 TraceCheckUtils]: 38: Hoare triple {11116#(not (= |main_~#i~2.base| |main_~#j~2.base|))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {11146#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:02,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {11146#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,338 INFO L290 TraceCheckUtils]: 42: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,338 INFO L290 TraceCheckUtils]: 43: Hoare triple {11160#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (<= (+ finddup_~i~1 1) finddup_~j~1) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:02,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {11161#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (<= (+ finddup_~i~1 2) finddup_~j~1) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:47:02,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} assume true; {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} is VALID [2022-04-27 11:47:02,342 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11162#(and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (<= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)))} {11116#(not (= |main_~#i~2.base| |main_~#j~2.base|))} #104#return; {11126#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {11126#(and (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {11127#(and (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} is VALID [2022-04-27 11:47:02,342 INFO L272 TraceCheckUtils]: 49: Hoare triple {11127#(and (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} call __VERIFIER_assert(~r~0); {11085#true} is VALID [2022-04-27 11:47:02,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {11085#true} ~cond := #in~cond; {11163#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:02,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {11163#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:02,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:02,344 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} {11127#(and (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,346 INFO L290 TraceCheckUtils]: 55: Hoare triple {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,346 INFO L272 TraceCheckUtils]: 56: Hoare triple {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,347 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11085#true} {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} #108#return; {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} is VALID [2022-04-27 11:47:02,347 INFO L290 TraceCheckUtils]: 61: Hoare triple {11132#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (<= 2 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:02,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:02,348 INFO L272 TraceCheckUtils]: 63: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:02,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:02,348 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:02,348 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:02,349 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11085#true} {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:02,349 INFO L290 TraceCheckUtils]: 68: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {11142#(not (= |main_#t~mem22| |main_#t~mem21|))} is VALID [2022-04-27 11:47:02,350 INFO L272 TraceCheckUtils]: 69: Hoare triple {11142#(not (= |main_#t~mem22| |main_#t~mem21|))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:02,350 INFO L290 TraceCheckUtils]: 70: Hoare triple {11143#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11144#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:47:02,350 INFO L290 TraceCheckUtils]: 71: Hoare triple {11144#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11086#false} is VALID [2022-04-27 11:47:02,350 INFO L290 TraceCheckUtils]: 72: Hoare triple {11086#false} assume !false; {11086#false} is VALID [2022-04-27 11:47:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:47:02,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:47:02,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642570451] [2022-04-27 11:47:02,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642570451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:47:02,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201326783] [2022-04-27 11:47:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:02,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:02,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:02,353 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:47:02,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-27 11:47:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-27 11:47:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:02,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:02,547 INFO L390 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 10 treesize of output 8 [2022-04-27 11:47:02,738 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-04-27 11:47:02,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-04-27 11:47:03,329 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-27 11:47:03,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2022-04-27 11:47:03,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {11085#true} call ULTIMATE.init(); {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #122#return; {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {11085#true} call #t~ret27 := main(); {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {11085#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {11085#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:03,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11085#true} {11085#true} #98#return; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {11085#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L272 TraceCheckUtils]: 12: Hoare triple {11085#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {11085#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11085#true} {11085#true} #100#return; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {11085#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L272 TraceCheckUtils]: 17: Hoare triple {11085#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {11085#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L272 TraceCheckUtils]: 19: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11085#true} {11085#true} #116#return; {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L272 TraceCheckUtils]: 24: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:03,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11085#true} {11085#true} #118#return; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L272 TraceCheckUtils]: 29: Hoare triple {11085#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11085#true} {11085#true} #120#return; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {11085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:03,406 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11085#true} {11085#true} #102#return; {11085#true} is VALID [2022-04-27 11:47:03,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {11085#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {11278#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:47:03,407 INFO L272 TraceCheckUtils]: 38: Hoare triple {11278#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {11085#true} is VALID [2022-04-27 11:47:03,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {11085#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {11159#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,408 INFO L290 TraceCheckUtils]: 42: Hoare triple {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,409 INFO L290 TraceCheckUtils]: 43: Hoare triple {11288#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {11298#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 2)) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,409 INFO L290 TraceCheckUtils]: 44: Hoare triple {11298#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 2)) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11298#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 2)) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:47:03,410 INFO L290 TraceCheckUtils]: 45: Hoare triple {11298#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 2)) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {11305#(and (= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)))} is VALID [2022-04-27 11:47:03,410 INFO L290 TraceCheckUtils]: 46: Hoare triple {11305#(and (= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)))} assume true; {11305#(and (= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)))} is VALID [2022-04-27 11:47:03,412 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11305#(and (= 2 (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|)) (or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)))} {11278#(and (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,413 INFO L272 TraceCheckUtils]: 49: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert(~r~0); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} ~cond := #in~cond; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,414 INFO L290 TraceCheckUtils]: 51: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume !(0 == ~cond); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,419 INFO L290 TraceCheckUtils]: 52: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume true; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,420 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} #106#return; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,420 INFO L290 TraceCheckUtils]: 54: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,421 INFO L290 TraceCheckUtils]: 55: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,422 INFO L272 TraceCheckUtils]: 56: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,423 INFO L290 TraceCheckUtils]: 57: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} ~cond := #in~cond; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume !(0 == ~cond); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume true; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,425 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} #108#return; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,426 INFO L290 TraceCheckUtils]: 62: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,427 INFO L272 TraceCheckUtils]: 63: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,428 INFO L290 TraceCheckUtils]: 64: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} ~cond := #in~cond; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume !(0 == ~cond); {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} assume true; {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} is VALID [2022-04-27 11:47:03,430 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11319#(and (exists ((|v_main_~#j~2.base_BEFORE_CALL_12| Int)) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_12|) 0) 2)) (exists ((|v_main_~#i~2.base_BEFORE_CALL_13| Int)) (= 0 (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_13|) 0))))} {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} #110#return; {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} is VALID [2022-04-27 11:47:03,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {11312#(and (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {11377#(and (= |main_#t~mem22| 2) (= |main_#t~mem21| 0))} is VALID [2022-04-27 11:47:03,431 INFO L272 TraceCheckUtils]: 69: Hoare triple {11377#(and (= |main_#t~mem22| 2) (= |main_#t~mem21| 0))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {11381#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:47:03,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {11381#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11385#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:03,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {11385#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11086#false} is VALID [2022-04-27 11:47:03,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {11086#false} assume !false; {11086#false} is VALID [2022-04-27 11:47:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:47:03,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:47:03,731 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-04-27 11:47:03,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 670 treesize of output 606 [2022-04-27 11:47:04,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {11086#false} assume !false; {11086#false} is VALID [2022-04-27 11:47:04,395 INFO L290 TraceCheckUtils]: 71: Hoare triple {11385#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11086#false} is VALID [2022-04-27 11:47:04,395 INFO L290 TraceCheckUtils]: 70: Hoare triple {11381#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11385#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:04,396 INFO L272 TraceCheckUtils]: 69: Hoare triple {11142#(not (= |main_#t~mem22| |main_#t~mem21|))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {11381#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:47:04,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {11142#(not (= |main_#t~mem22| |main_#t~mem21|))} is VALID [2022-04-27 11:47:04,397 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {11085#true} {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #110#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,397 INFO L290 TraceCheckUtils]: 64: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,397 INFO L272 TraceCheckUtils]: 63: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,398 INFO L290 TraceCheckUtils]: 61: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,398 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {11085#true} {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #108#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,398 INFO L290 TraceCheckUtils]: 59: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,398 INFO L290 TraceCheckUtils]: 58: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,398 INFO L290 TraceCheckUtils]: 57: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,399 INFO L272 TraceCheckUtils]: 56: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,399 INFO L290 TraceCheckUtils]: 55: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,399 INFO L290 TraceCheckUtils]: 54: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,400 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {11085#true} {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} #106#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,400 INFO L272 TraceCheckUtils]: 49: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} call __VERIFIER_assert(~r~0); {11085#true} is VALID [2022-04-27 11:47:04,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,402 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11471#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} {11467#(or (not (= |main_~#j~2.offset| |main_~#i~2.offset|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {11137#(not (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)))} is VALID [2022-04-27 11:47:04,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {11471#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} assume true; {11471#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} is VALID [2022-04-27 11:47:04,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {11478#(or (and (or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1))) (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))) (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {11471#(or (not (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} is VALID [2022-04-27 11:47:04,404 INFO L290 TraceCheckUtils]: 44: Hoare triple {11478#(or (and (or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1))) (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))) (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11478#(or (and (or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1))) (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))) (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} is VALID [2022-04-27 11:47:04,405 INFO L290 TraceCheckUtils]: 43: Hoare triple {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {11478#(or (and (or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (not (= finddup_~j~1 finddup_~i~1))) (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset) (not (= finddup_~j~1 finddup_~i~1))) (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)))) (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)))} is VALID [2022-04-27 11:47:04,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} is VALID [2022-04-27 11:47:04,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} is VALID [2022-04-27 11:47:04,407 INFO L290 TraceCheckUtils]: 40: Hoare triple {11495#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {11485#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (not (= |finddup_#in~_i.base| finddup_~_i.base)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (not (= finddup_~i~1 (+ finddup_~j~1 1))) (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} is VALID [2022-04-27 11:47:04,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {11085#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {11495#(or (and (= |finddup_#in~_i.offset| |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| |finddup_#in~_j.base|)) (and (or (not (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|)) (not (= |finddup_#in~_i.base| finddup_~_i.base))) (or (and (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (and (= |finddup_#in~_j.base| finddup_~_i.base) (= |finddup_#in~_i.base| finddup_~_j.base) (= |finddup_#in~_j.offset| finddup_~_i.offset) (= |finddup_#in~_i.offset| finddup_~_j.offset)))))} is VALID [2022-04-27 11:47:04,408 INFO L272 TraceCheckUtils]: 38: Hoare triple {11467#(or (not (= |main_~#j~2.offset| |main_~#i~2.offset|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {11085#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {11467#(or (not (= |main_~#j~2.offset| |main_~#i~2.offset|)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:47:04,408 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11085#true} {11085#true} #102#return; {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L290 TraceCheckUtils]: 34: Hoare triple {11085#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {11085#true} {11085#true} #120#return; {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 30: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L272 TraceCheckUtils]: 29: Hoare triple {11085#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11085#true} {11085#true} #118#return; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L272 TraceCheckUtils]: 24: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11085#true} {11085#true} #116#return; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {11085#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {11085#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L272 TraceCheckUtils]: 17: Hoare triple {11085#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {11085#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11085#true} {11085#true} #100#return; {11085#true} is VALID [2022-04-27 11:47:04,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {11085#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L272 TraceCheckUtils]: 12: Hoare triple {11085#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {11085#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11085#true} {11085#true} #98#return; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {11085#true} assume !(0 == ~cond); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#true} ~cond := #in~cond; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {11085#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {11085#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {11085#true} call #t~ret27 := main(); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11085#true} {11085#true} #122#return; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} assume true; {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11085#true} is VALID [2022-04-27 11:47:04,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {11085#true} call ULTIMATE.init(); {11085#true} is VALID [2022-04-27 11:47:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:47:04,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201326783] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:47:04,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:47:04,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 11] total 31 [2022-04-27 11:47:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758605520] [2022-04-27 11:47:04,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:47:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 73 [2022-04-27 11:47:04,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:47:04,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 11:47:04,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:04,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-27 11:47:04,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:47:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-27 11:47:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:47:04,509 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 11:47:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:08,801 INFO L93 Difference]: Finished difference Result 181 states and 211 transitions. [2022-04-27 11:47:08,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-27 11:47:08,801 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) Word has length 73 [2022-04-27 11:47:08,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:47:08,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 11:47:08,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 162 transitions. [2022-04-27 11:47:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 11:47:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 162 transitions. [2022-04-27 11:47:08,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 162 transitions. [2022-04-27 11:47:08,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:47:09,002 INFO L225 Difference]: With dead ends: 181 [2022-04-27 11:47:09,002 INFO L226 Difference]: Without dead ends: 179 [2022-04-27 11:47:09,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=430, Invalid=3230, Unknown=0, NotChecked=0, Total=3660 [2022-04-27 11:47:09,004 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 209 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:47:09,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 78 Invalid, 1778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1452 Invalid, 0 Unknown, 142 Unchecked, 1.6s Time] [2022-04-27 11:47:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-27 11:47:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 139. [2022-04-27 11:47:09,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:47:09,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-04-27 11:47:09,159 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-04-27 11:47:09,159 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-04-27 11:47:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:09,163 INFO L93 Difference]: Finished difference Result 179 states and 209 transitions. [2022-04-27 11:47:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2022-04-27 11:47:09,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:09,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:09,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) Second operand 179 states. [2022-04-27 11:47:09,164 INFO L87 Difference]: Start difference. First operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) Second operand 179 states. [2022-04-27 11:47:09,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:47:09,168 INFO L93 Difference]: Finished difference Result 179 states and 209 transitions. [2022-04-27 11:47:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2022-04-27 11:47:09,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:47:09,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:47:09,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:47:09,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:47:09,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 102 states have internal predecessors, (112), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (25), 22 states have call predecessors, (25), 22 states have call successors, (25) [2022-04-27 11:47:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2022-04-27 11:47:09,172 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 73 [2022-04-27 11:47:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:47:09,173 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2022-04-27 11:47:09,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 2.92) internal successors, (73), 27 states have internal predecessors, (73), 10 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (18), 5 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-27 11:47:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2022-04-27 11:47:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 11:47:09,174 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:47:09,174 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:47:09,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-27 11:47:09,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-27 11:47:09,388 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:47:09,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:47:09,388 INFO L85 PathProgramCache]: Analyzing trace with hash 680409498, now seen corresponding path program 1 times [2022-04-27 11:47:09,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:47:09,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751064053] [2022-04-27 11:47:09,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:09,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:47:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:47:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {12537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12473#true} is VALID [2022-04-27 11:47:09,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,614 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12473#true} {12473#true} #122#return; {12473#true} is VALID [2022-04-27 11:47:09,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:47:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #98#return; {12473#true} is VALID [2022-04-27 11:47:09,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:47:09,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12473#true} is VALID [2022-04-27 11:47:09,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,633 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12473#true} {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:47:09,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:47:09,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:47:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,645 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #116#return; {12473#true} is VALID [2022-04-27 11:47:09,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:47:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #118#return; {12473#true} is VALID [2022-04-27 11:47:09,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:47:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #120#return; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L272 TraceCheckUtils]: 1: Hoare triple {12473#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 3: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 4: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12473#true} {12473#true} #116#return; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L272 TraceCheckUtils]: 6: Hoare triple {12473#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12473#true} {12473#true} #118#return; {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {12473#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12473#true} {12473#true} #120#return; {12473#true} is VALID [2022-04-27 11:47:09,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {12473#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {12473#true} is VALID [2022-04-27 11:47:09,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,652 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12473#true} {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} #102#return; {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} is VALID [2022-04-27 11:47:09,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:47:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} is VALID [2022-04-27 11:47:09,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} is VALID [2022-04-27 11:47:09,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {12552#(or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (and (= (select (select |#memory_int| |finddup_#in~a.base|) 0) |finddup_#t~mem10|) (= finddup_~i~1 0) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (* finddup_~j~1 4))) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (= |finddup_#in~_i.base| |finddup_#in~a.base|))) (not (= |finddup_#in~a.offset| 0)))} is VALID [2022-04-27 11:47:09,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {12552#(or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (and (= (select (select |#memory_int| |finddup_#in~a.base|) 0) |finddup_#t~mem10|) (= finddup_~i~1 0) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (* finddup_~j~1 4))) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (= |finddup_#in~_i.base| |finddup_#in~a.base|))) (not (= |finddup_#in~a.offset| 0)))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} is VALID [2022-04-27 11:47:09,885 INFO L290 TraceCheckUtils]: 4: Hoare triple {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} assume true; {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} is VALID [2022-04-27 11:47:09,887 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} {12506#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {12513#(and (= main_~a~0.offset 0) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2022-04-27 11:47:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 11:47:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12554#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:09,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {12554#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:09,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:09,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} {12514#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {12519#(and (= main_~a~0.offset 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2022-04-27 11:47:09,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-27 11:47:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #108#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-27 11:47:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #110#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-04-27 11:47:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:09,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #112#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {12473#true} call ULTIMATE.init(); {12537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:47:09,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {12537#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12473#true} is VALID [2022-04-27 11:47:09,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #122#return; {12473#true} is VALID [2022-04-27 11:47:09,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {12473#true} call #t~ret27 := main(); {12473#true} is VALID [2022-04-27 11:47:09,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {12473#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {12473#true} is VALID [2022-04-27 11:47:09,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {12473#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12473#true} {12473#true} #98#return; {12473#true} is VALID [2022-04-27 11:47:09,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {12473#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:47:09,924 INFO L272 TraceCheckUtils]: 12: Hoare triple {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {12538#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:09,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12473#true} is VALID [2022-04-27 11:47:09,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,925 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12473#true} {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:47:09,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} is VALID [2022-04-27 11:47:09,927 INFO L272 TraceCheckUtils]: 17: Hoare triple {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {12538#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L272 TraceCheckUtils]: 19: Hoare triple {12473#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 21: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 22: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12473#true} {12473#true} #116#return; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L272 TraceCheckUtils]: 24: Hoare triple {12473#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 25: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 26: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,927 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12473#true} {12473#true} #118#return; {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L272 TraceCheckUtils]: 29: Hoare triple {12473#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12473#true} {12473#true} #120#return; {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {12473#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L290 TraceCheckUtils]: 35: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,928 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12473#true} {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} #102#return; {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} is VALID [2022-04-27 11:47:09,929 INFO L290 TraceCheckUtils]: 37: Hoare triple {12486#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {12506#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:47:09,930 INFO L272 TraceCheckUtils]: 38: Hoare triple {12506#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {12538#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:47:09,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} is VALID [2022-04-27 11:47:09,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} is VALID [2022-04-27 11:47:09,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {12551#(and (or (not (= finddup_~a.offset 0)) (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~a.offset (* finddup_~i~1 4)) 0) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (= finddup_~a.offset 0) (= finddup_~a.offset |finddup_#in~a.offset|)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {12552#(or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (and (= (select (select |#memory_int| |finddup_#in~a.base|) 0) |finddup_#t~mem10|) (= finddup_~i~1 0) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (* finddup_~j~1 4))) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (= |finddup_#in~_i.base| |finddup_#in~a.base|))) (not (= |finddup_#in~a.offset| 0)))} is VALID [2022-04-27 11:47:09,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {12552#(or (and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (and (= (select (select |#memory_int| |finddup_#in~a.base|) 0) |finddup_#t~mem10|) (= finddup_~i~1 0) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (* finddup_~j~1 4))) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset)) (= |finddup_#in~_i.base| |finddup_#in~a.base|))) (not (= |finddup_#in~a.offset| 0)))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} is VALID [2022-04-27 11:47:09,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} assume true; {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} is VALID [2022-04-27 11:47:09,935 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12553#(or (and (or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 0)) (= (select (select |#memory_int| |finddup_#in~a.base|) 0) (select (select |#memory_int| |finddup_#in~a.base|) (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))) (not (= |finddup_#in~a.offset| 0)) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|))} {12506#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {12513#(and (= main_~a~0.offset 0) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2022-04-27 11:47:09,936 INFO L290 TraceCheckUtils]: 45: Hoare triple {12513#(and (= main_~a~0.offset 0) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= |main_#t~ret14| 0) (= |main_~#i~2.base| |main_~#j~2.base|))) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {12514#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} is VALID [2022-04-27 11:47:09,936 INFO L272 TraceCheckUtils]: 46: Hoare triple {12514#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} call __VERIFIER_assert(~r~0); {12473#true} is VALID [2022-04-27 11:47:09,936 INFO L290 TraceCheckUtils]: 47: Hoare triple {12473#true} ~cond := #in~cond; {12554#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:47:09,936 INFO L290 TraceCheckUtils]: 48: Hoare triple {12554#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:09,937 INFO L290 TraceCheckUtils]: 49: Hoare triple {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:09,937 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} {12514#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)) (or (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (and (= main_~r~0 0) (= |main_~#i~2.base| |main_~#j~2.base|))))} #106#return; {12519#(and (= main_~a~0.offset 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} is VALID [2022-04-27 11:47:09,938 INFO L290 TraceCheckUtils]: 51: Hoare triple {12519#(and (= main_~a~0.offset 0) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)) (select (select |#memory_int| main_~a~0.base) 0)))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {12520#(and (or (not |main_#t~short17|) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))) (= main_~a~0.offset 0))} is VALID [2022-04-27 11:47:09,938 INFO L290 TraceCheckUtils]: 52: Hoare triple {12520#(and (or (not |main_#t~short17|) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))) (= main_~a~0.offset 0))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,938 INFO L272 TraceCheckUtils]: 53: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,939 INFO L290 TraceCheckUtils]: 54: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,939 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #108#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,940 INFO L290 TraceCheckUtils]: 58: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,940 INFO L290 TraceCheckUtils]: 59: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,940 INFO L272 TraceCheckUtils]: 60: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,941 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #110#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,941 INFO L290 TraceCheckUtils]: 65: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,941 INFO L272 TraceCheckUtils]: 66: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:47:09,942 INFO L290 TraceCheckUtils]: 67: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:47:09,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:47:09,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:47:09,943 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {12473#true} {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #112#return; {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:47:09,943 INFO L290 TraceCheckUtils]: 71: Hoare triple {12521#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem21;havoc #t~mem22;call #t~mem23 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem23, 4);call #t~mem24 := read~int(~#j~2.base, ~#j~2.offset, 4);call #t~mem26 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem24, 4); {12534#(= |main_#t~mem26| |main_#t~mem25|)} is VALID [2022-04-27 11:47:09,944 INFO L272 TraceCheckUtils]: 72: Hoare triple {12534#(= |main_#t~mem26| |main_#t~mem25|)} call __VERIFIER_assert((if #t~mem25 == #t~mem26 then 1 else 0)); {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:47:09,944 INFO L290 TraceCheckUtils]: 73: Hoare triple {12535#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12536#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:47:09,944 INFO L290 TraceCheckUtils]: 74: Hoare triple {12536#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12474#false} is VALID [2022-04-27 11:47:09,944 INFO L290 TraceCheckUtils]: 75: Hoare triple {12474#false} assume !false; {12474#false} is VALID [2022-04-27 11:47:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 11:47:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:47:09,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751064053] [2022-04-27 11:47:09,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751064053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:47:09,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889122935] [2022-04-27 11:47:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:47:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:47:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:47:09,946 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:47:09,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-27 11:47:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:10,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 118 conjunts are in the unsatisfiable core [2022-04-27 11:47:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:47:10,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:47:10,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-04-27 11:47:10,216 INFO L390 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 6 treesize of output 4 [2022-04-27 11:47:12,652 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (<= 0 mkdup_~i~0))) is different from true [2022-04-27 11:47:12,897 INFO L390 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 29 treesize of output 24 [2022-04-27 11:47:17,254 INFO L390 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 10 treesize of output 8 [2022-04-27 11:47:19,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:47:19,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2022-04-27 11:47:19,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:47:19,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:47:19,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2022-04-27 11:47:20,032 INFO L390 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 [2022-04-27 11:47:20,065 INFO L390 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 [2022-04-27 11:48:35,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:48:35,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:48:35,388 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-27 11:48:35,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 47 [2022-04-27 11:48:35,529 INFO L390 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 26 treesize of output 22 [2022-04-27 11:48:35,599 INFO L390 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 26 treesize of output 22 [2022-04-27 11:48:35,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {12473#true} call ULTIMATE.init(); {12473#true} is VALID [2022-04-27 11:48:35,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {12473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12473#true} is VALID [2022-04-27 11:48:35,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:48:35,925 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12473#true} {12473#true} #122#return; {12473#true} is VALID [2022-04-27 11:48:35,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {12473#true} call #t~ret27 := main(); {12473#true} is VALID [2022-04-27 11:48:35,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {12473#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {12473#true} is VALID [2022-04-27 11:48:35,926 INFO L272 TraceCheckUtils]: 6: Hoare triple {12473#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:48:35,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {12473#true} ~cond := #in~cond; {12473#true} is VALID [2022-04-27 11:48:35,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {12473#true} assume !(0 == ~cond); {12473#true} is VALID [2022-04-27 11:48:35,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {12473#true} assume true; {12473#true} is VALID [2022-04-27 11:48:35,926 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12473#true} {12473#true} #98#return; {12473#true} is VALID [2022-04-27 11:48:35,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {12473#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:48:35,927 INFO L272 TraceCheckUtils]: 12: Hoare triple {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {12473#true} is VALID [2022-04-27 11:48:35,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {12473#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12597#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:48:35,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {12597#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {12597#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:48:35,928 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12597#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {12482#(and (= |main_#t~malloc13.offset| 0) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {12604#(and (= |main_#t~malloc13.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:48:35,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {12604#(and (= |main_#t~malloc13.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|)) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {12608#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} is VALID [2022-04-27 11:48:35,930 INFO L272 TraceCheckUtils]: 17: Hoare triple {12608#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {12538#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:48:35,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {12615#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:48:35,930 INFO L272 TraceCheckUtils]: 19: Hoare triple {12615#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:48:35,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {12473#true} ~cond := #in~cond; {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:48:35,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,932 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} {12615#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {12633#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:48:35,932 INFO L272 TraceCheckUtils]: 24: Hoare triple {12633#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {12473#true} is VALID [2022-04-27 11:48:35,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {12473#true} ~cond := #in~cond; {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:48:35,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,934 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} {12633#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {12649#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0))} is VALID [2022-04-27 11:48:35,935 INFO L272 TraceCheckUtils]: 29: Hoare triple {12649#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {12473#true} is VALID [2022-04-27 11:48:35,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {12473#true} ~cond := #in~cond; {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:48:35,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {12622#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,936 INFO L290 TraceCheckUtils]: 32: Hoare triple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {12626#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:48:35,936 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {12626#(not (= |assume_abort_if_not_#in~cond| 0))} {12649#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0))} #120#return; {12665#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))} is VALID [2022-04-27 11:48:37,945 WARN L290 TraceCheckUtils]: 34: Hoare triple {12665#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {12669#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:48:39,954 WARN L290 TraceCheckUtils]: 35: Hoare triple {12669#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} assume true; {12669#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:48:39,956 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12669#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} {12608#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} #102#return; {12676#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} is VALID [2022-04-27 11:48:39,957 INFO L290 TraceCheckUtils]: 37: Hoare triple {12676#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {12680#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:48:39,958 INFO L272 TraceCheckUtils]: 38: Hoare triple {12680#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {12538#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:48:39,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {12538#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {12687#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:48:39,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {12687#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {12691#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:48:39,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {12691#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {12695#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= |finddup_#in~_i.base| finddup_~_i.base) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:48:39,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {12695#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= |finddup_#in~_i.base| finddup_~_i.base) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {12699#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 1))))} is VALID [2022-04-27 11:48:39,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {12699#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 1))))} assume true; {12699#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 1))))} is VALID [2022-04-27 11:48:39,963 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {12699#(and (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |old(#memory_int)| |finddup_#in~a.base|) |finddup_#in~a.offset|)) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 0)) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 1))))} {12680#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,966 INFO L272 TraceCheckUtils]: 46: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} call __VERIFIER_assert(~r~0); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,968 INFO L290 TraceCheckUtils]: 47: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} ~cond := #in~cond; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume !(0 == ~cond); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume true; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,971 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} #106#return; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,972 INFO L290 TraceCheckUtils]: 51: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,975 INFO L272 TraceCheckUtils]: 53: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} ~cond := #in~cond; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,978 INFO L290 TraceCheckUtils]: 55: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume !(0 == ~cond); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume true; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,980 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} #108#return; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,984 INFO L272 TraceCheckUtils]: 60: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,985 INFO L290 TraceCheckUtils]: 61: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} ~cond := #in~cond; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume !(0 == ~cond); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,988 INFO L290 TraceCheckUtils]: 63: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume true; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,988 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} #110#return; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,989 INFO L290 TraceCheckUtils]: 65: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,991 INFO L272 TraceCheckUtils]: 66: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,993 INFO L290 TraceCheckUtils]: 67: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} ~cond := #in~cond; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,994 INFO L290 TraceCheckUtils]: 68: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume !(0 == ~cond); {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} assume true; {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} is VALID [2022-04-27 11:48:39,997 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {12713#(exists ((mkdup_~j~0 Int) (|v_main_~#i~2.base_BEFORE_CALL_22| Int) (|v_main_~#j~2.base_BEFORE_CALL_21| Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int) (v_main_~a~0.base_BEFORE_CALL_8 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#j~2.base_BEFORE_CALL_21|) (<= 0 mkdup_~j~0) (< (+ v_main_~a~0.base_BEFORE_CALL_8 1) |v_main_~#i~2.base_BEFORE_CALL_22|) (= (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_21|) 0) 1) (= (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 4) (select (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0) 0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_8) (store (store ((as const (Array Int Int)) 0) (* mkdup_~i~0 4) mkdup_~x~0) (* mkdup_~j~0 4) mkdup_~x~0)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_22|) 0) 0)))} {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} #112#return; {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} is VALID [2022-04-27 11:48:39,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {12706#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 1) (= 0 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#i~2.base|) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) main_~a~0.offset) (select (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0) (+ main_~a~0.offset 4))) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|))} havoc #t~mem21;havoc #t~mem22;call #t~mem23 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem23, 4);call #t~mem24 := read~int(~#j~2.base, ~#j~2.offset, 4);call #t~mem26 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem24, 4); {12534#(= |main_#t~mem26| |main_#t~mem25|)} is VALID [2022-04-27 11:48:39,998 INFO L272 TraceCheckUtils]: 72: Hoare triple {12534#(= |main_#t~mem26| |main_#t~mem25|)} call __VERIFIER_assert((if #t~mem25 == #t~mem26 then 1 else 0)); {12792#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:48:39,998 INFO L290 TraceCheckUtils]: 73: Hoare triple {12792#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12796#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:48:39,999 INFO L290 TraceCheckUtils]: 74: Hoare triple {12796#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12474#false} is VALID [2022-04-27 11:48:39,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {12474#false} assume !false; {12474#false} is VALID [2022-04-27 11:48:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-27 11:48:40,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:48:57,383 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-27 11:48:57,387 INFO L390 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 6 treesize of output 4 [2022-04-27 11:49:04,063 WARN L804 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-04-27 11:49:06,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889122935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:49:06,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:49:06,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 39 [2022-04-27 11:49:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430039045] [2022-04-27 11:49:06,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:49:06,776 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) Word has length 76 [2022-04-27 11:49:06,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:49:06,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 11:49:12,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 108 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 11:49:12,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-27 11:49:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:49:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-27 11:49:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2165, Unknown=18, NotChecked=94, Total=2450 [2022-04-27 11:49:12,942 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 11:50:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:08,111 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2022-04-27 11:50:08,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-27 11:50:08,112 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) Word has length 76 [2022-04-27 11:50:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:08,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 11:50:08,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 122 transitions. [2022-04-27 11:50:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 11:50:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 122 transitions. [2022-04-27 11:50:08,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 122 transitions. [2022-04-27 11:50:14,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 119 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:14,325 INFO L225 Difference]: With dead ends: 189 [2022-04-27 11:50:14,325 INFO L226 Difference]: Without dead ends: 117 [2022-04-27 11:50:14,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 99 SyntacticMatches, 10 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 146.5s TimeCoverageRelationStatistics Valid=409, Invalid=5250, Unknown=45, NotChecked=148, Total=5852 [2022-04-27 11:50:14,327 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 120 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 1987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:14,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 189 Invalid, 1987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1525 Invalid, 0 Unknown, 373 Unchecked, 1.6s Time] [2022-04-27 11:50:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-27 11:50:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2022-04-27 11:50:14,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:14,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:14,457 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:14,457 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:14,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:14,459 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-27 11:50:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-27 11:50:14,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:14,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:14,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 117 states. [2022-04-27 11:50:14,460 INFO L87 Difference]: Start difference. First operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 117 states. [2022-04-27 11:50:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:14,463 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-27 11:50:14,463 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-27 11:50:14,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:14,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:14,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:14,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2022-04-27 11:50:14,466 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 76 [2022-04-27 11:50:14,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:14,466 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2022-04-27 11:50:14,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.032258064516129) internal successors, (63), 29 states have internal predecessors, (63), 13 states have call successors, (26), 6 states have call predecessors, (26), 8 states have return successors, (22), 12 states have call predecessors, (22), 12 states have call successors, (22) [2022-04-27 11:50:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2022-04-27 11:50:14,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-27 11:50:14,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:14,467 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:14,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-27 11:50:14,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-27 11:50:14,689 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1727442411, now seen corresponding path program 5 times [2022-04-27 11:50:14,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:14,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195476234] [2022-04-27 11:50:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:14,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:50:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {13704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13641#true} is VALID [2022-04-27 11:50:14,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13641#true} {13641#true} #122#return; {13641#true} is VALID [2022-04-27 11:50:14,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:50:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #98#return; {13641#true} is VALID [2022-04-27 11:50:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:50:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13641#true} is VALID [2022-04-27 11:50:14,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13641#true} {13641#true} #100#return; {13641#true} is VALID [2022-04-27 11:50:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:50:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:50:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #116#return; {13641#true} is VALID [2022-04-27 11:50:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:50:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #118#return; {13641#true} is VALID [2022-04-27 11:50:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:50:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #120#return; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L272 TraceCheckUtils]: 1: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13641#true} {13641#true} #116#return; {13641#true} is VALID [2022-04-27 11:50:14,753 INFO L272 TraceCheckUtils]: 6: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13641#true} {13641#true} #118#return; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {13641#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13641#true} {13641#true} #120#return; {13641#true} is VALID [2022-04-27 11:50:14,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {13641#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {13641#true} is VALID [2022-04-27 11:50:14,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,755 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13641#true} {13641#true} #102#return; {13641#true} is VALID [2022-04-27 11:50:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:50:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {13641#true} is VALID [2022-04-27 11:50:14,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:14,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(~j~1 < ~n); {13721#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:14,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {13721#(<= finddup_~n (+ finddup_~i~1 3))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13722#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {13722#(<= finddup_~n (+ finddup_~i~1 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13724#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:50:14,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {13724#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {13642#false} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {13642#false} assume !(~i~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {13642#false} #res := 0; {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {13642#false} assume true; {13642#false} is VALID [2022-04-27 11:50:14,838 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13642#false} {13641#true} #104#return; {13642#false} is VALID [2022-04-27 11:50:14,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {13641#true} call ULTIMATE.init(); {13704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {13704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #122#return; {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {13641#true} call #t~ret27 := main(); {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {13641#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L272 TraceCheckUtils]: 6: Hoare triple {13641#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,839 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13641#true} {13641#true} #98#return; {13641#true} is VALID [2022-04-27 11:50:14,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {13641#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {13641#true} is VALID [2022-04-27 11:50:14,840 INFO L272 TraceCheckUtils]: 12: Hoare triple {13641#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {13705#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:14,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13641#true} is VALID [2022-04-27 11:50:14,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13641#true} {13641#true} #100#return; {13641#true} is VALID [2022-04-27 11:50:14,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {13641#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {13641#true} is VALID [2022-04-27 11:50:14,841 INFO L272 TraceCheckUtils]: 17: Hoare triple {13641#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {13705#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:14,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L272 TraceCheckUtils]: 19: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13641#true} {13641#true} #116#return; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L272 TraceCheckUtils]: 24: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13641#true} {13641#true} #118#return; {13641#true} is VALID [2022-04-27 11:50:14,842 INFO L272 TraceCheckUtils]: 29: Hoare triple {13641#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13641#true} {13641#true} #120#return; {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {13641#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:14,850 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13641#true} {13641#true} #102#return; {13641#true} is VALID [2022-04-27 11:50:14,851 INFO L290 TraceCheckUtils]: 37: Hoare triple {13641#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {13641#true} is VALID [2022-04-27 11:50:14,852 INFO L272 TraceCheckUtils]: 38: Hoare triple {13641#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {13705#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:14,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {13705#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {13641#true} is VALID [2022-04-27 11:50:14,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {13641#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,853 INFO L290 TraceCheckUtils]: 41: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:14,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,854 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:14,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(~j~1 < ~n); {13721#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:14,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {13721#(<= finddup_~n (+ finddup_~i~1 3))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13722#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:14,857 INFO L290 TraceCheckUtils]: 49: Hoare triple {13722#(<= finddup_~n (+ finddup_~i~1 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,857 INFO L290 TraceCheckUtils]: 50: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:14,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13724#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 53: Hoare triple {13724#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 54: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 55: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 56: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 57: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 58: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 59: Hoare triple {13642#false} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 61: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:14,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {13642#false} assume !(~i~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 68: Hoare triple {13642#false} #res := 0; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {13642#false} assume true; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13642#false} {13641#true} #104#return; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {13642#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L272 TraceCheckUtils]: 72: Hoare triple {13642#false} call __VERIFIER_assert(~r~0); {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 73: Hoare triple {13642#false} ~cond := #in~cond; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {13642#false} assume 0 == ~cond; {13642#false} is VALID [2022-04-27 11:50:14,860 INFO L290 TraceCheckUtils]: 75: Hoare triple {13642#false} assume !false; {13642#false} is VALID [2022-04-27 11:50:14,861 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:50:14,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195476234] [2022-04-27 11:50:14,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195476234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:50:14,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444257385] [2022-04-27 11:50:14,861 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 11:50:14,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:14,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:14,862 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:50:14,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-27 11:50:14,965 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-04-27 11:50:14,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:50:14,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 11:50:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:14,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:15,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {13641#true} call ULTIMATE.init(); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #122#return; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {13641#true} call #t~ret27 := main(); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {13641#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {13641#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13641#true} {13641#true} #98#return; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {13641#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L272 TraceCheckUtils]: 12: Hoare triple {13641#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {13641#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,179 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13641#true} {13641#true} #100#return; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {13641#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L272 TraceCheckUtils]: 17: Hoare triple {13641#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {13641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L272 TraceCheckUtils]: 19: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13641#true} {13641#true} #116#return; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L272 TraceCheckUtils]: 24: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13641#true} {13641#true} #118#return; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L272 TraceCheckUtils]: 29: Hoare triple {13641#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,180 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13641#true} {13641#true} #120#return; {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {13641#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13641#true} {13641#true} #102#return; {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {13641#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L272 TraceCheckUtils]: 38: Hoare triple {13641#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {13641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {13641#true} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {13641#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:15,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(~j~1 < ~n); {13721#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:15,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {13721#(<= finddup_~n (+ finddup_~i~1 3))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13722#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {13722#(<= finddup_~n (+ finddup_~i~1 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13724#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {13724#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {13642#false} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:15,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 66: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 67: Hoare triple {13642#false} assume !(~i~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 68: Hoare triple {13642#false} #res := 0; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 69: Hoare triple {13642#false} assume true; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13642#false} {13641#true} #104#return; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {13642#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L272 TraceCheckUtils]: 72: Hoare triple {13642#false} call __VERIFIER_assert(~r~0); {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 73: Hoare triple {13642#false} ~cond := #in~cond; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {13642#false} assume 0 == ~cond; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {13642#false} assume !false; {13642#false} is VALID [2022-04-27 11:50:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:50:15,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:50:15,423 INFO L290 TraceCheckUtils]: 75: Hoare triple {13642#false} assume !false; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 74: Hoare triple {13642#false} assume 0 == ~cond; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 73: Hoare triple {13642#false} ~cond := #in~cond; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L272 TraceCheckUtils]: 72: Hoare triple {13642#false} call __VERIFIER_assert(~r~0); {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 71: Hoare triple {13642#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {13642#false} {13641#true} #104#return; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 69: Hoare triple {13642#false} assume true; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 68: Hoare triple {13642#false} #res := 0; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 67: Hoare triple {13642#false} assume !(~i~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 66: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 65: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 64: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 61: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 60: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:15,424 INFO L290 TraceCheckUtils]: 59: Hoare triple {13642#false} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:15,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {13642#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13642#false} is VALID [2022-04-27 11:50:15,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {13642#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13642#false} is VALID [2022-04-27 11:50:15,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {13642#false} assume !(~j~1 < ~n); {13642#false} is VALID [2022-04-27 11:50:15,425 INFO L290 TraceCheckUtils]: 55: Hoare triple {13642#false} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13642#false} is VALID [2022-04-27 11:50:15,425 INFO L290 TraceCheckUtils]: 54: Hoare triple {13642#false} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13642#false} is VALID [2022-04-27 11:50:15,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {13724#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13642#false} is VALID [2022-04-27 11:50:15,428 INFO L290 TraceCheckUtils]: 52: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13724#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:50:15,428 INFO L290 TraceCheckUtils]: 51: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,428 INFO L290 TraceCheckUtils]: 50: Hoare triple {13723#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {13722#(<= finddup_~n (+ finddup_~i~1 2))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13723#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:50:15,430 INFO L290 TraceCheckUtils]: 48: Hoare triple {13721#(<= finddup_~n (+ finddup_~i~1 3))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {13722#(<= finddup_~n (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(~j~1 < ~n); {13721#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:15,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13720#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:50:15,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,432 INFO L290 TraceCheckUtils]: 43: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {13719#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:50:15,432 INFO L290 TraceCheckUtils]: 42: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,433 INFO L290 TraceCheckUtils]: 41: Hoare triple {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,433 INFO L290 TraceCheckUtils]: 40: Hoare triple {13641#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {13718#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:50:15,433 INFO L290 TraceCheckUtils]: 39: Hoare triple {13641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {13641#true} is VALID [2022-04-27 11:50:15,433 INFO L272 TraceCheckUtils]: 38: Hoare triple {13641#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {13641#true} is VALID [2022-04-27 11:50:15,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {13641#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {13641#true} is VALID [2022-04-27 11:50:15,433 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13641#true} {13641#true} #102#return; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {13641#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13641#true} {13641#true} #120#return; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L272 TraceCheckUtils]: 29: Hoare triple {13641#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13641#true} {13641#true} #118#return; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,434 INFO L272 TraceCheckUtils]: 24: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13641#true} {13641#true} #116#return; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L272 TraceCheckUtils]: 19: Hoare triple {13641#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {13641#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L272 TraceCheckUtils]: 17: Hoare triple {13641#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {13641#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13641#true} {13641#true} #100#return; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {13641#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L272 TraceCheckUtils]: 12: Hoare triple {13641#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {13641#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13641#true} {13641#true} #98#return; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {13641#true} assume !(0 == ~cond); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {13641#true} ~cond := #in~cond; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L272 TraceCheckUtils]: 6: Hoare triple {13641#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {13641#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {13641#true} call #t~ret27 := main(); {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13641#true} {13641#true} #122#return; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {13641#true} assume true; {13641#true} is VALID [2022-04-27 11:50:15,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13641#true} is VALID [2022-04-27 11:50:15,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {13641#true} call ULTIMATE.init(); {13641#true} is VALID [2022-04-27 11:50:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 43 proven. 15 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-27 11:50:15,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444257385] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:50:15,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:50:15,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-04-27 11:50:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405678443] [2022-04-27 11:50:15,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:50:15,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2022-04-27 11:50:15,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:50:15,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:50:15,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:15,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 11:50:15,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:50:15,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 11:50:15,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 11:50:15,488 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:50:16,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:16,627 INFO L93 Difference]: Finished difference Result 217 states and 256 transitions. [2022-04-27 11:50:16,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 11:50:16,627 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2022-04-27 11:50:16,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:50:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:50:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-27 11:50:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:50:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2022-04-27 11:50:16,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 136 transitions. [2022-04-27 11:50:16,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:50:16,759 INFO L225 Difference]: With dead ends: 217 [2022-04-27 11:50:16,759 INFO L226 Difference]: Without dead ends: 141 [2022-04-27 11:50:16,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-27 11:50:16,760 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 106 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:50:16,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 59 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:50:16,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-27 11:50:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2022-04-27 11:50:16,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:50:16,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:16,966 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:16,966 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:16,969 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-27 11:50:16,969 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2022-04-27 11:50:16,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:16,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:16,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 141 states. [2022-04-27 11:50:16,970 INFO L87 Difference]: Start difference. First operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 141 states. [2022-04-27 11:50:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:50:16,972 INFO L93 Difference]: Finished difference Result 141 states and 164 transitions. [2022-04-27 11:50:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 164 transitions. [2022-04-27 11:50:16,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:50:16,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:50:16,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:50:16,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:50:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 100 states have internal predecessors, (111), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:50:16,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 153 transitions. [2022-04-27 11:50:16,975 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 153 transitions. Word has length 76 [2022-04-27 11:50:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:50:16,975 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 153 transitions. [2022-04-27 11:50:16,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:50:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 153 transitions. [2022-04-27 11:50:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-27 11:50:16,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:50:16,976 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:50:17,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-27 11:50:17,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-27 11:50:17,191 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:50:17,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:50:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1008133877, now seen corresponding path program 6 times [2022-04-27 11:50:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:50:17,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840419382] [2022-04-27 11:50:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:50:17,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:50:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:50:17,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {15037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14968#true} is VALID [2022-04-27 11:50:17,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14968#true} {14968#true} #122#return; {14968#true} is VALID [2022-04-27 11:50:17,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:50:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:17,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:17,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14968#true} {14968#true} #98#return; {14968#true} is VALID [2022-04-27 11:50:17,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:50:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:17,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:17,532 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {14968#true} #100#return; {14980#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:50:17,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:50:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:50:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:17,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:17,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:17,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:50:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:17,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:17,808 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,809 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:50:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:17,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:17,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:17,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:17,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {15053#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:50:17,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:17,841 INFO L272 TraceCheckUtils]: 1: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:17,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:17,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:17,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,842 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:17,842 INFO L272 TraceCheckUtils]: 6: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:17,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:17,842 INFO L290 TraceCheckUtils]: 8: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:17,842 INFO L290 TraceCheckUtils]: 9: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:17,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:17,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:17,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:17,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:17,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:17,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {15053#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:50:17,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {15053#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:50:17,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:50:17,853 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {14981#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:50:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:50:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:24,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {15057#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:50:24,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {15057#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15058#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {15058#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15059#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:50:24,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {15059#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15060#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {15060#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15062#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:50:24,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {15062#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15063#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:50:24,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {15063#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15064#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:50:24,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {15064#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 3) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(~j~1 < ~n); {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15066#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 4) finddup_~n) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 4) finddup_~n) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~n)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~n) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {15066#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 4) finddup_~n) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 4) finddup_~n) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~n)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~n) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15067#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (or (<= (+ finddup_~j~1 3) finddup_~n) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {15067#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (or (<= (+ finddup_~j~1 3) finddup_~n) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15068#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {15068#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15069#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {15069#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15070#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (<= finddup_~j~1 (+ finddup_~i~1 2)))} is VALID [2022-04-27 11:50:24,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {15070#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (<= finddup_~j~1 (+ finddup_~i~1 2)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15071#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n)))} is VALID [2022-04-27 11:50:24,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {15071#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15072#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {15072#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15073#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 1) finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~j~1 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {15073#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 1) finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~j~1 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} assume !(~j~1 < ~n); {15074#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {15074#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15075#(or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#in~a.base| finddup_~a.base)))} is VALID [2022-04-27 11:50:24,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {15075#(or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#in~a.base| finddup_~a.base)))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15076#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {15076#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15077#(or (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| |finddup_#t~mem10|))) (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {15077#(or (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| |finddup_#t~mem10|))) (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~j~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,087 INFO L290 TraceCheckUtils]: 28: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~j~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~i~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #res := 0; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume true; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,094 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} #104#return; {14969#false} is VALID [2022-04-27 11:50:24,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {14968#true} call ULTIMATE.init(); {15037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:50:24,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {15037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14968#true} {14968#true} #122#return; {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {14968#true} call #t~ret27 := main(); {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {14968#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {14968#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:24,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:24,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:24,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14968#true} {14968#true} #98#return; {14968#true} is VALID [2022-04-27 11:50:24,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {14968#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {14968#true} is VALID [2022-04-27 11:50:24,097 INFO L272 TraceCheckUtils]: 12: Hoare triple {14968#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {15038#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:24,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:24,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:24,098 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {14968#true} #100#return; {14980#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:50:24,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {14980#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {14981#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:50:24,099 INFO L272 TraceCheckUtils]: 17: Hoare triple {14981#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {15038#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:24,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:24,100 INFO L272 TraceCheckUtils]: 19: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:24,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:24,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:24,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:24,101 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:24,101 INFO L272 TraceCheckUtils]: 24: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:24,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:24,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:24,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:24,101 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {14968#true} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:50:24,102 INFO L272 TraceCheckUtils]: 29: Hoare triple {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:24,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:24,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:24,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:24,103 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15040#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {15053#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:50:24,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {15053#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:50:24,107 INFO L290 TraceCheckUtils]: 35: Hoare triple {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:50:24,110 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15054#(and (= (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0) (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (or (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {14981#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:50:24,111 INFO L290 TraceCheckUtils]: 37: Hoare triple {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:50:24,112 INFO L272 TraceCheckUtils]: 38: Hoare triple {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {15038#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:24,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {15057#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:50:24,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {15057#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15058#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {15058#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15059#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:50:24,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {15059#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15060#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,117 INFO L290 TraceCheckUtils]: 43: Hoare triple {15060#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,121 INFO L290 TraceCheckUtils]: 46: Hoare triple {15061#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15062#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:50:24,122 INFO L290 TraceCheckUtils]: 47: Hoare triple {15062#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15063#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:50:24,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {15063#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15064#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:50:24,126 INFO L290 TraceCheckUtils]: 49: Hoare triple {15064#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 3) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !(~j~1 < ~n); {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,131 INFO L290 TraceCheckUtils]: 51: Hoare triple {15065#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 4) finddup_~n) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (+ finddup_~i~1 3) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (+ finddup_~i~1 3) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15066#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 4) finddup_~n) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 4) finddup_~n) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~n)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~n) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {15066#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 4) finddup_~n) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 4) finddup_~n) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~n)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~n) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15067#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (or (<= (+ finddup_~j~1 3) finddup_~n) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {15067#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (<= finddup_~j~1 (+ finddup_~i~1 1)) (or (<= (+ finddup_~j~1 3) finddup_~n) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15068#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {15068#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15069#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:50:24,142 INFO L290 TraceCheckUtils]: 55: Hoare triple {15069#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) finddup_~i~1)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 3) finddup_~n)) (<= finddup_~j~1 (+ finddup_~i~1 1)) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15070#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (<= finddup_~j~1 (+ finddup_~i~1 2)))} is VALID [2022-04-27 11:50:24,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {15070#(and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))) (<= finddup_~j~1 (+ finddup_~i~1 2)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15071#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n)))} is VALID [2022-04-27 11:50:24,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {15071#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15072#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {15072#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 2) finddup_~n) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ finddup_~j~1 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (+ finddup_~i~1 finddup_~n))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15073#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 1) finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~j~1 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:50:24,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {15073#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (<= (+ finddup_~j~1 1) finddup_~n)) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (<= (+ finddup_~j~1 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) (+ finddup_~i~1 finddup_~n)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (<= (+ finddup_~j~1 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) (+ finddup_~i~1 finddup_~n)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))))} assume !(~j~1 < ~n); {15074#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {15074#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ finddup_~i~1 2) (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (<= (+ finddup_~i~1 2) (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15075#(or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#in~a.base| finddup_~a.base)))} is VALID [2022-04-27 11:50:24,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {15075#(or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#in~a.base| finddup_~a.base)))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15076#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:50:24,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {15076#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15077#(or (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| |finddup_#t~mem10|))) (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {15077#(or (and (not (= ((as const (Array Int Int)) 0) (select |old(#memory_int)| |finddup_#in~a.base|))) (or (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| |finddup_#t~mem10|))) (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (= |finddup_#t~mem10| 0) (= |finddup_#t~mem11| (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~j~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,166 INFO L290 TraceCheckUtils]: 66: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,166 INFO L290 TraceCheckUtils]: 67: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,167 INFO L290 TraceCheckUtils]: 68: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~j~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,168 INFO L290 TraceCheckUtils]: 69: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,169 INFO L290 TraceCheckUtils]: 70: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume !(~i~1 < ~n); {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,170 INFO L290 TraceCheckUtils]: 71: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} #res := 0; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} assume true; {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} is VALID [2022-04-27 11:50:24,172 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15078#(or (not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0))))) (not (= (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))} {15001#(and (or (= (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (= (select (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))) (select (select |#memory_int| main_~a~0.base) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} #104#return; {14969#false} is VALID [2022-04-27 11:50:24,173 INFO L290 TraceCheckUtils]: 74: Hoare triple {14969#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {14969#false} is VALID [2022-04-27 11:50:24,173 INFO L272 TraceCheckUtils]: 75: Hoare triple {14969#false} call __VERIFIER_assert(~r~0); {14969#false} is VALID [2022-04-27 11:50:24,173 INFO L290 TraceCheckUtils]: 76: Hoare triple {14969#false} ~cond := #in~cond; {14969#false} is VALID [2022-04-27 11:50:24,173 INFO L290 TraceCheckUtils]: 77: Hoare triple {14969#false} assume 0 == ~cond; {14969#false} is VALID [2022-04-27 11:50:24,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {14969#false} assume !false; {14969#false} is VALID [2022-04-27 11:50:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 83 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 11:50:24,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:50:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840419382] [2022-04-27 11:50:24,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840419382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:50:24,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546796611] [2022-04-27 11:50:24,174 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 11:50:24,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:50:24,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:50:24,175 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:50:24,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-27 11:50:24,289 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-27 11:50:24,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:50:24,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-27 11:50:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:50:24,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:50:24,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-04-27 11:50:38,810 INFO L390 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 29 treesize of output 24 [2022-04-27 11:50:59,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {14968#true} call ULTIMATE.init(); {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {14968#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14968#true} {14968#true} #122#return; {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {14968#true} call #t~ret27 := main(); {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {14968#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L272 TraceCheckUtils]: 6: Hoare triple {14968#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {14968#true} ~cond := #in~cond; {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {14968#true} assume !(0 == ~cond); {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {14968#true} assume true; {14968#true} is VALID [2022-04-27 11:50:59,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14968#true} {14968#true} #98#return; {14968#true} is VALID [2022-04-27 11:50:59,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {14968#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {15115#(= |main_#t~malloc13.offset| 0)} is VALID [2022-04-27 11:50:59,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {15115#(= |main_#t~malloc13.offset| 0)} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {14968#true} is VALID [2022-04-27 11:50:59,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {14968#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:59,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:50:59,289 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15039#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {15115#(= |main_#t~malloc13.offset| 0)} #100#return; {15128#(and (= |main_#t~malloc13.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|)))} is VALID [2022-04-27 11:50:59,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {15128#(and (= |main_#t~malloc13.offset| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|)))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {15132#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} is VALID [2022-04-27 11:50:59,290 INFO L272 TraceCheckUtils]: 17: Hoare triple {15132#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {15038#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:50:59,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {15139#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:50:59,291 INFO L272 TraceCheckUtils]: 19: Hoare triple {15139#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:59,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:59,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,293 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15139#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {15155#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} is VALID [2022-04-27 11:50:59,293 INFO L272 TraceCheckUtils]: 24: Hoare triple {15155#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:59,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:59,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,295 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15155#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 mkdup_~n))} #118#return; {15171#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:50:59,295 INFO L272 TraceCheckUtils]: 29: Hoare triple {15171#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {14968#true} is VALID [2022-04-27 11:50:59,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {14968#true} ~cond := #in~cond; {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:50:59,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {15055#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {15056#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:50:59,298 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {15056#(not (= |assume_abort_if_not_#in~cond| 0))} {15171#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} #120#return; {15187#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:51:01,303 WARN L290 TraceCheckUtils]: 34: Hoare triple {15187#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {15191#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:51:03,307 WARN L290 TraceCheckUtils]: 35: Hoare triple {15191#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} assume true; {15191#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:51:03,309 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15191#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (<= 0 mkdup_~j~0) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|)))} {15132#(and (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)))} #102#return; {15198#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} is VALID [2022-04-27 11:51:03,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {15198#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {15198#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} is VALID [2022-04-27 11:51:03,311 INFO L272 TraceCheckUtils]: 38: Hoare triple {15198#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {15038#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:51:03,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {15038#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {15208#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {15208#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15212#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {15212#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15216#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))))} is VALID [2022-04-27 11:51:03,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {15216#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15220#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {15220#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15220#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {15220#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15227#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} is VALID [2022-04-27 11:51:03,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {15227#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15231#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {15231#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15235#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {15235#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15239#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (< finddup_~j~1 finddup_~n) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} is VALID [2022-04-27 11:51:03,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {15239#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (< finddup_~j~1 finddup_~n) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15243#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (< finddup_~j~1 finddup_~n))} is VALID [2022-04-27 11:51:03,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {15243#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (< finddup_~j~1 finddup_~n))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15247#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (< v_finddup_~j~1_119 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {15247#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (< v_finddup_~j~1_119 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !(~j~1 < ~n); {15251#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))))} is VALID [2022-04-27 11:51:03,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {15251#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (= finddup_~i~1 0) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15255#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:51:03,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {15255#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15259#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:51:03,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {15259#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15263#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,329 INFO L290 TraceCheckUtils]: 54: Hoare triple {15263#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (< finddup_~j~1 finddup_~n))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,333 INFO L290 TraceCheckUtils]: 55: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,341 INFO L290 TraceCheckUtils]: 57: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,351 INFO L290 TraceCheckUtils]: 59: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} assume !(~j~1 < ~n); {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,356 INFO L290 TraceCheckUtils]: 60: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} is VALID [2022-04-27 11:51:03,364 INFO L290 TraceCheckUtils]: 62: Hoare triple {15267#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* v_finddup_~j~1_119 4))))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) finddup_~a.offset) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (< finddup_~j~1 finddup_~n))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {15292#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (< finddup_~j~1 finddup_~n) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))} is VALID [2022-04-27 11:51:03,369 INFO L290 TraceCheckUtils]: 63: Hoare triple {15292#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (< finddup_~j~1 finddup_~n) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {15296#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (< finddup_~j~1 finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,373 INFO L290 TraceCheckUtils]: 64: Hoare triple {15296#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (< finddup_~j~1 finddup_~n) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {15300#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)))) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_121 1)))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {15300#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)))) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_121 1)))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} assume !(~j~1 < ~n); {15304#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)))) (<= finddup_~n (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {15304#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)))) (<= finddup_~n (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15308#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {15308#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {15312#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (< finddup_~i~1 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,395 INFO L290 TraceCheckUtils]: 68: Hoare triple {15312#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (< finddup_~i~1 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} assume !(~j~1 < ~n); {15312#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (< finddup_~i~1 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {15312#(and (<= |finddup_#in~n| finddup_~n) (= |#memory_int| |old(#memory_int)|) (< finddup_~i~1 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4))))) (< v_finddup_~j~1_121 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {15319#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int)) (and (< v_finddup_~i~1_82 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~i~1 (+ v_finddup_~i~1_82 1)))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} is VALID [2022-04-27 11:51:03,407 INFO L290 TraceCheckUtils]: 70: Hoare triple {15319#(and (<= |finddup_#in~n| finddup_~n) (exists ((v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int)) (and (< v_finddup_~i~1_82 finddup_~n) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~i~1 (+ v_finddup_~i~1_82 1)))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (<= 2 v_finddup_~j~1_120) (< v_finddup_~j~1_120 finddup_~n))) (exists ((v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 finddup_~n))))} assume !(~i~1 < ~n); {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} is VALID [2022-04-27 11:51:03,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} #res := 0; {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} is VALID [2022-04-27 11:51:03,415 INFO L290 TraceCheckUtils]: 72: Hoare triple {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} assume true; {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} is VALID [2022-04-27 11:51:03,419 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15323#(and (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (exists ((v_finddup_~j~1_120 Int) (v_finddup_~j~1_121 Int) (v_finddup_~i~1_82 Int) (v_finddup_~j~1_119 Int)) (and (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* v_finddup_~i~1_82 4) (- 4))))) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4)) (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_120 4) |finddup_#in~a.offset|)))) (< v_finddup_~i~1_82 (+ v_finddup_~j~1_119 1)) (<= 2 v_finddup_~j~1_120) (<= |finddup_#in~n| (+ v_finddup_~j~1_119 1)) (not (= (select (select |#memory_int| |finddup_#in~a.base|) (+ (* v_finddup_~j~1_119 4) |finddup_#in~a.offset| (- 4))) (select (select |#memory_int| |finddup_#in~a.base|) |finddup_#in~a.offset|))) (< v_finddup_~j~1_119 (+ v_finddup_~j~1_121 1)) (< v_finddup_~j~1_120 (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_121 (+ v_finddup_~i~1_82 1)))))} {15198#(and (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))))} #104#return; {14969#false} is VALID [2022-04-27 11:51:03,419 INFO L290 TraceCheckUtils]: 74: Hoare triple {14969#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {14969#false} is VALID [2022-04-27 11:51:03,419 INFO L272 TraceCheckUtils]: 75: Hoare triple {14969#false} call __VERIFIER_assert(~r~0); {14969#false} is VALID [2022-04-27 11:51:03,419 INFO L290 TraceCheckUtils]: 76: Hoare triple {14969#false} ~cond := #in~cond; {14969#false} is VALID [2022-04-27 11:51:03,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {14969#false} assume 0 == ~cond; {14969#false} is VALID [2022-04-27 11:51:03,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {14969#false} assume !false; {14969#false} is VALID [2022-04-27 11:51:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 81 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-27 11:51:03,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:51:06,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546796611] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:51:06,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:51:06,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 38] total 67 [2022-04-27 11:51:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217305669] [2022-04-27 11:51:06,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:51:06,643 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 79 [2022-04-27 11:51:06,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:51:06,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-04-27 11:51:12,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 121 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:51:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-27 11:51:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:51:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-27 11:51:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=4235, Unknown=15, NotChecked=0, Total=4556 [2022-04-27 11:51:12,959 INFO L87 Difference]: Start difference. First operand 131 states and 153 transitions. Second operand has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-04-27 11:54:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:01,413 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2022-04-27 11:54:01,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-27 11:54:01,413 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) Word has length 79 [2022-04-27 11:54:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:01,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-04-27 11:54:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 156 transitions. [2022-04-27 11:54:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-04-27 11:54:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 156 transitions. [2022-04-27 11:54:01,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 156 transitions. [2022-04-27 11:54:11,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 150 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:11,905 INFO L225 Difference]: With dead ends: 166 [2022-04-27 11:54:11,905 INFO L226 Difference]: Without dead ends: 132 [2022-04-27 11:54:11,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5232 ImplicationChecksByTransitivity, 194.7s TimeCoverageRelationStatistics Valid=995, Invalid=16219, Unknown=78, NotChecked=0, Total=17292 [2022-04-27 11:54:11,908 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 33 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 285 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:11,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 240 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 915 Invalid, 0 Unknown, 285 Unchecked, 1.5s Time] [2022-04-27 11:54:11,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-27 11:54:12,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-04-27 11:54:12,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:12,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:54:12,162 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:54:12,163 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:54:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:12,165 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-04-27 11:54:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-04-27 11:54:12,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:12,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:12,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 132 states. [2022-04-27 11:54:12,166 INFO L87 Difference]: Start difference. First operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) Second operand 132 states. [2022-04-27 11:54:12,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:12,168 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2022-04-27 11:54:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2022-04-27 11:54:12,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:12,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:12,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:12,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 97 states have internal predecessors, (107), 21 states have call successors, (21), 11 states have call predecessors, (21), 12 states have return successors, (21), 19 states have call predecessors, (21), 19 states have call successors, (21) [2022-04-27 11:54:12,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 149 transitions. [2022-04-27 11:54:12,181 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 149 transitions. Word has length 79 [2022-04-27 11:54:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:12,181 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 149 transitions. [2022-04-27 11:54:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 11 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (14), 11 states have call predecessors, (14), 10 states have call successors, (14) [2022-04-27 11:54:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 149 transitions. [2022-04-27 11:54:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-27 11:54:12,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:12,182 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:12,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-27 11:54:12,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:12,399 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 690301670, now seen corresponding path program 1 times [2022-04-27 11:54:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:12,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054119687] [2022-04-27 11:54:12,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:12,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:54:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {16242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16171#true} is VALID [2022-04-27 11:54:12,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,600 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16171#true} {16171#true} #122#return; {16171#true} is VALID [2022-04-27 11:54:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #98#return; {16171#true} is VALID [2022-04-27 11:54:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:54:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16171#true} is VALID [2022-04-27 11:54:12,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16171#true} {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:54:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:54:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:54:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #116#return; {16171#true} is VALID [2022-04-27 11:54:12,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #118#return; {16171#true} is VALID [2022-04-27 11:54:12,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:54:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #120#return; {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L272 TraceCheckUtils]: 1: Hoare triple {16171#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {16171#true} {16171#true} #116#return; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {16171#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16171#true} {16171#true} #118#return; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L272 TraceCheckUtils]: 11: Hoare triple {16171#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16171#true} {16171#true} #120#return; {16171#true} is VALID [2022-04-27 11:54:12,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {16171#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {16171#true} is VALID [2022-04-27 11:54:12,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,640 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16171#true} {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} #102#return; {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} is VALID [2022-04-27 11:54:12,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:54:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(~j~1 < ~n); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16257#(and (= |finddup_#in~_j.base| finddup_~_j.base) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (and (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {16257#(and (= |finddup_#in~_j.base| finddup_~_j.base) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (and (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} is VALID [2022-04-27 11:54:12,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} assume true; {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} is VALID [2022-04-27 11:54:12,829 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} {16204#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {16220#(and (= main_~a~0.offset 0) (or (= |main_#t~ret14| 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} is VALID [2022-04-27 11:54:12,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-04-27 11:54:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16259#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:12,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {16259#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:12,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:12,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} {16221#(and (= main_~a~0.offset 0) (or (= main_~r~0 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} #106#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-04-27 11:54:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #108#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-27 11:54:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #110#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-04-27 11:54:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:12,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #112#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {16171#true} call ULTIMATE.init(); {16242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:54:12,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {16242#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #122#return; {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {16171#true} call #t~ret27 := main(); {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {16171#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {16171#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16171#true} {16171#true} #98#return; {16171#true} is VALID [2022-04-27 11:54:12,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {16171#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:54:12,866 INFO L272 TraceCheckUtils]: 12: Hoare triple {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {16243#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:12,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16171#true} is VALID [2022-04-27 11:54:12,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,867 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16171#true} {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:54:12,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} is VALID [2022-04-27 11:54:12,869 INFO L272 TraceCheckUtils]: 17: Hoare triple {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {16243#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L272 TraceCheckUtils]: 19: Hoare triple {16171#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16171#true} {16171#true} #116#return; {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L272 TraceCheckUtils]: 24: Hoare triple {16171#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16171#true} {16171#true} #118#return; {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L272 TraceCheckUtils]: 29: Hoare triple {16171#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16171#true} {16171#true} #120#return; {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {16171#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {16171#true} is VALID [2022-04-27 11:54:12,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,871 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16171#true} {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} #102#return; {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} is VALID [2022-04-27 11:54:12,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {16204#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:54:12,873 INFO L272 TraceCheckUtils]: 38: Hoare triple {16204#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {16243#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:12,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,875 INFO L290 TraceCheckUtils]: 42: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,877 INFO L290 TraceCheckUtils]: 45: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,877 INFO L290 TraceCheckUtils]: 46: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(~j~1 < ~n); {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,879 INFO L290 TraceCheckUtils]: 50: Hoare triple {16256#(and (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16257#(and (= |finddup_#in~_j.base| finddup_~_j.base) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (and (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:12,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {16257#(and (= |finddup_#in~_j.base| finddup_~_j.base) (or (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (and (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|))) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} is VALID [2022-04-27 11:54:12,881 INFO L290 TraceCheckUtils]: 52: Hoare triple {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} assume true; {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} is VALID [2022-04-27 11:54:12,883 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16258#(or (= |finddup_#in~_i.base| |finddup_#in~_j.base|) (= |finddup_#in~_j.base| |finddup_#in~a.base|) (= |finddup_#in~_i.base| |finddup_#in~a.base|) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_i.base|) |finddup_#in~_i.offset|) 4))) (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* (select (select |#memory_int| |finddup_#in~_j.base|) |finddup_#in~_j.offset|) 4)))))} {16204#(and (= main_~a~0.offset 0) (not (= main_~a~0.base |main_~#j~2.base|)) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {16220#(and (= main_~a~0.offset 0) (or (= |main_#t~ret14| 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} is VALID [2022-04-27 11:54:12,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {16220#(and (= main_~a~0.offset 0) (or (= |main_#t~ret14| 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {16221#(and (= main_~a~0.offset 0) (or (= main_~r~0 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} is VALID [2022-04-27 11:54:12,884 INFO L272 TraceCheckUtils]: 55: Hoare triple {16221#(and (= main_~a~0.offset 0) (or (= main_~r~0 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} call __VERIFIER_assert(~r~0); {16171#true} is VALID [2022-04-27 11:54:12,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {16171#true} ~cond := #in~cond; {16259#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:12,884 INFO L290 TraceCheckUtils]: 57: Hoare triple {16259#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:12,885 INFO L290 TraceCheckUtils]: 58: Hoare triple {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:12,886 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} {16221#(and (= main_~a~0.offset 0) (or (= main_~r~0 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4)))))} #106#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,886 INFO L290 TraceCheckUtils]: 60: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,887 INFO L290 TraceCheckUtils]: 61: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,887 INFO L272 TraceCheckUtils]: 62: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,887 INFO L290 TraceCheckUtils]: 63: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,887 INFO L290 TraceCheckUtils]: 64: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,887 INFO L290 TraceCheckUtils]: 65: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,891 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #108#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,892 INFO L290 TraceCheckUtils]: 67: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,893 INFO L290 TraceCheckUtils]: 68: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,893 INFO L272 TraceCheckUtils]: 69: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,893 INFO L290 TraceCheckUtils]: 70: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,893 INFO L290 TraceCheckUtils]: 71: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,893 INFO L290 TraceCheckUtils]: 72: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,894 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #110#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,894 INFO L290 TraceCheckUtils]: 74: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,894 INFO L272 TraceCheckUtils]: 75: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:12,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:12,894 INFO L290 TraceCheckUtils]: 77: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:12,895 INFO L290 TraceCheckUtils]: 78: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:12,895 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16171#true} {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} #112#return; {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} is VALID [2022-04-27 11:54:12,896 INFO L290 TraceCheckUtils]: 80: Hoare triple {16226#(and (= main_~a~0.offset 0) (= (select (select |#memory_int| main_~a~0.base) (* 4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (select (select |#memory_int| main_~a~0.base) (* (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 4))))} havoc #t~mem21;havoc #t~mem22;call #t~mem23 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem23, 4);call #t~mem24 := read~int(~#j~2.base, ~#j~2.offset, 4);call #t~mem26 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem24, 4); {16239#(= |main_#t~mem26| |main_#t~mem25|)} is VALID [2022-04-27 11:54:12,897 INFO L272 TraceCheckUtils]: 81: Hoare triple {16239#(= |main_#t~mem26| |main_#t~mem25|)} call __VERIFIER_assert((if #t~mem25 == #t~mem26 then 1 else 0)); {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:54:12,897 INFO L290 TraceCheckUtils]: 82: Hoare triple {16240#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16241#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:54:12,897 INFO L290 TraceCheckUtils]: 83: Hoare triple {16241#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16172#false} is VALID [2022-04-27 11:54:12,898 INFO L290 TraceCheckUtils]: 84: Hoare triple {16172#false} assume !false; {16172#false} is VALID [2022-04-27 11:54:12,898 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-27 11:54:12,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:12,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054119687] [2022-04-27 11:54:12,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054119687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:54:12,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828125026] [2022-04-27 11:54:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:12,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:12,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:12,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:54:12,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-27 11:54:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:13,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-27 11:54:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:13,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:13,061 INFO L390 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 6 treesize of output 5 [2022-04-27 11:54:13,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 6 treesize of output 5 [2022-04-27 11:54:14,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:54:14,105 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-04-27 11:54:14,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 18 [2022-04-27 11:54:14,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:54:14,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:54:14,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-04-27 11:54:14,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:54:14,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2022-04-27 11:54:14,685 INFO L390 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 [2022-04-27 11:54:14,689 INFO L390 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 [2022-04-27 11:54:21,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-27 11:54:21,716 INFO L356 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2022-04-27 11:54:21,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 36 [2022-04-27 11:54:21,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {16171#true} call ULTIMATE.init(); {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {16171#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16171#true} {16171#true} #122#return; {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {16171#true} call #t~ret27 := main(); {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {16171#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {16171#true} is VALID [2022-04-27 11:54:21,812 INFO L272 TraceCheckUtils]: 6: Hoare triple {16171#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {16171#true} is VALID [2022-04-27 11:54:21,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {16171#true} ~cond := #in~cond; {16171#true} is VALID [2022-04-27 11:54:21,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {16171#true} assume !(0 == ~cond); {16171#true} is VALID [2022-04-27 11:54:21,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {16171#true} assume true; {16171#true} is VALID [2022-04-27 11:54:21,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16171#true} {16171#true} #98#return; {16171#true} is VALID [2022-04-27 11:54:21,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {16171#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:54:21,814 INFO L272 TraceCheckUtils]: 12: Hoare triple {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume true; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,816 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} #100#return; {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} is VALID [2022-04-27 11:54:21,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {16180#(and (= |main_#t~malloc13.offset| 0) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} is VALID [2022-04-27 11:54:21,817 INFO L272 TraceCheckUtils]: 17: Hoare triple {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:54:21,819 INFO L272 TraceCheckUtils]: 19: Hoare triple {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} ~cond := #in~cond; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume !(0 == ~cond); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume true; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,820 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:54:21,821 INFO L272 TraceCheckUtils]: 24: Hoare triple {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} ~cond := #in~cond; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume !(0 == ~cond); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume true; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,823 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} #118#return; {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:54:21,824 INFO L272 TraceCheckUtils]: 29: Hoare triple {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} ~cond := #in~cond; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,825 INFO L290 TraceCheckUtils]: 31: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume !(0 == ~cond); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,825 INFO L290 TraceCheckUtils]: 32: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume true; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,826 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} #120#return; {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:54:21,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {16318#(and (exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1))) (= mkdup_~a.base |mkdup_#in~a.base|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} assume true; {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} is VALID [2022-04-27 11:54:21,827 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16299#(exists ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (and (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|) (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)))} {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} #102#return; {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} is VALID [2022-04-27 11:54:21,828 INFO L290 TraceCheckUtils]: 37: Hoare triple {16184#(and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= main_~a~0.offset 0) (= (select |#valid| main_~a~0.base) 1))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {16376#(and (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} is VALID [2022-04-27 11:54:21,829 INFO L272 TraceCheckUtils]: 38: Hoare triple {16376#(and (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {16243#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:21,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {16243#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,832 INFO L290 TraceCheckUtils]: 44: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,833 INFO L290 TraceCheckUtils]: 46: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !(~j~1 < ~n); {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {16383#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~i~1 0) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {16411#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,834 INFO L290 TraceCheckUtils]: 49: Hoare triple {16411#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {16415#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,834 INFO L290 TraceCheckUtils]: 50: Hoare triple {16415#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#in~_i.base| finddup_~_i.base) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {16419#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= |finddup_#in~_i.base| finddup_~_i.base) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} is VALID [2022-04-27 11:54:21,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {16419#(and (= finddup_~i~1 1) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~_j.base| finddup_~_j.base) (= finddup_~_j.offset |finddup_#in~_j.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#t~mem11| (select (select |#memory_int| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|))) (= |finddup_#in~_i.base| finddup_~_i.base) (= (select (select |#memory_int| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) |finddup_#t~mem10|) (= |finddup_#in~_i.offset| finddup_~_i.offset))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {16423#(and (exists ((v_ArrVal_694 (Array Int Int))) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 1)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| v_ArrVal_694) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 2)))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 8)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4))))} is VALID [2022-04-27 11:54:21,836 INFO L290 TraceCheckUtils]: 52: Hoare triple {16423#(and (exists ((v_ArrVal_694 (Array Int Int))) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 1)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| v_ArrVal_694) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 2)))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 8)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4))))} assume true; {16423#(and (exists ((v_ArrVal_694 (Array Int Int))) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 1)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| v_ArrVal_694) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 2)))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 8)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4))))} is VALID [2022-04-27 11:54:21,837 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16423#(and (exists ((v_ArrVal_694 (Array Int Int))) (= |#memory_int| (store (store |old(#memory_int)| |finddup_#in~_i.base| (store (select |old(#memory_int)| |finddup_#in~_i.base|) |finddup_#in~_i.offset| 1)) |finddup_#in~_j.base| (store (select (store |old(#memory_int)| |finddup_#in~_i.base| v_ArrVal_694) |finddup_#in~_j.base|) |finddup_#in~_j.offset| 2)))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 8)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ |finddup_#in~a.offset| 4))))} {16376#(and (= main_~a~0.offset 0) (= |main_~#j~2.offset| 0) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (not (= |main_~#i~2.base| |main_~#j~2.base|)))} #104#return; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,839 INFO L272 TraceCheckUtils]: 55: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} call __VERIFIER_assert(~r~0); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} ~cond := #in~cond; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,841 INFO L290 TraceCheckUtils]: 57: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume !(0 == ~cond); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume true; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,843 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} #106#return; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,843 INFO L290 TraceCheckUtils]: 60: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,844 INFO L290 TraceCheckUtils]: 61: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,845 INFO L272 TraceCheckUtils]: 62: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} ~cond := #in~cond; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,847 INFO L290 TraceCheckUtils]: 64: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume !(0 == ~cond); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,847 INFO L290 TraceCheckUtils]: 65: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume true; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,848 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} #108#return; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,849 INFO L290 TraceCheckUtils]: 67: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,849 INFO L290 TraceCheckUtils]: 68: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,850 INFO L272 TraceCheckUtils]: 69: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} ~cond := #in~cond; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume !(0 == ~cond); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume true; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,854 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} #110#return; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,854 INFO L290 TraceCheckUtils]: 74: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,855 INFO L272 TraceCheckUtils]: 75: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,856 INFO L290 TraceCheckUtils]: 76: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} ~cond := #in~cond; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume !(0 == ~cond); {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,858 INFO L290 TraceCheckUtils]: 78: Hoare triple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} assume true; {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} is VALID [2022-04-27 11:54:21,859 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16437#(exists ((|v_main_~#i~2.base_BEFORE_CALL_33| Int) (|v_main_~#j~2.base_BEFORE_CALL_32| Int) (v_main_~a~0.base_BEFORE_CALL_24 Int)) (and (< (+ v_main_~a~0.base_BEFORE_CALL_24 1) |v_main_~#j~2.base_BEFORE_CALL_32|) (= 2 (select (select |#memory_int| |v_main_~#j~2.base_BEFORE_CALL_32|) 0)) (not (= v_main_~a~0.base_BEFORE_CALL_24 |v_main_~#i~2.base_BEFORE_CALL_33|)) (= (select (select |#memory_int| |v_main_~#i~2.base_BEFORE_CALL_33|) 0) 1) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 8) (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_24) 4))))} {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} #112#return; {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} is VALID [2022-04-27 11:54:21,859 INFO L290 TraceCheckUtils]: 80: Hoare triple {16430#(and (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (= |main_~#j~2.offset| 0) (= (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|) 2) (= |main_~#i~2.offset| 0) (< (+ main_~a~0.base 1) |main_~#j~2.base|) (not (= |main_~#i~2.base| main_~a~0.base)) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 4)) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))))} havoc #t~mem21;havoc #t~mem22;call #t~mem23 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem25 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem23, 4);call #t~mem24 := read~int(~#j~2.base, ~#j~2.offset, 4);call #t~mem26 := read~int(~a~0.base, ~a~0.offset + 4 * #t~mem24, 4); {16239#(= |main_#t~mem26| |main_#t~mem25|)} is VALID [2022-04-27 11:54:21,860 INFO L272 TraceCheckUtils]: 81: Hoare triple {16239#(= |main_#t~mem26| |main_#t~mem25|)} call __VERIFIER_assert((if #t~mem25 == #t~mem26 then 1 else 0)); {16516#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:54:21,860 INFO L290 TraceCheckUtils]: 82: Hoare triple {16516#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16520#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:54:21,860 INFO L290 TraceCheckUtils]: 83: Hoare triple {16520#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16172#false} is VALID [2022-04-27 11:54:21,860 INFO L290 TraceCheckUtils]: 84: Hoare triple {16172#false} assume !false; {16172#false} is VALID [2022-04-27 11:54:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-04-27 11:54:21,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:54:22,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828125026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:54:22,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:54:22,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2022-04-27 11:54:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170426162] [2022-04-27 11:54:22,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:54:22,205 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 85 [2022-04-27 11:54:22,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:22,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-04-27 11:54:22,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:22,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-27 11:54:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-27 11:54:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2022-04-27 11:54:22,306 INFO L87 Difference]: Start difference. First operand 128 states and 149 transitions. Second operand has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-04-27 11:54:28,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:28,548 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2022-04-27 11:54:28,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 11:54:28,549 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 85 [2022-04-27 11:54:28,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-04-27 11:54:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-27 11:54:28,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-04-27 11:54:28,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 128 transitions. [2022-04-27 11:54:28,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 128 transitions. [2022-04-27 11:54:28,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:28,728 INFO L225 Difference]: With dead ends: 182 [2022-04-27 11:54:28,728 INFO L226 Difference]: Without dead ends: 121 [2022-04-27 11:54:28,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 114 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=329, Invalid=3210, Unknown=1, NotChecked=0, Total=3540 [2022-04-27 11:54:28,729 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 154 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:28,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 239 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1210 Invalid, 0 Unknown, 332 Unchecked, 1.4s Time] [2022-04-27 11:54:28,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-27 11:54:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2022-04-27 11:54:29,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:29,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:29,018 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:29,018 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:29,020 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-04-27 11:54:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2022-04-27 11:54:29,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:29,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:29,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) Second operand 121 states. [2022-04-27 11:54:29,021 INFO L87 Difference]: Start difference. First operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) Second operand 121 states. [2022-04-27 11:54:29,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:29,023 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2022-04-27 11:54:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2022-04-27 11:54:29,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:29,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:29,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:29,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:29,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 84 states have (on average 1.0952380952380953) internal successors, (92), 86 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2022-04-27 11:54:29,026 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 85 [2022-04-27 11:54:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:29,026 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2022-04-27 11:54:29,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 2.92) internal successors, (73), 25 states have internal predecessors, (73), 10 states have call successors, (26), 7 states have call predecessors, (26), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2022-04-27 11:54:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2022-04-27 11:54:29,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 11:54:29,027 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:29,027 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:29,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-27 11:54:29,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:29,250 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:29,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:29,250 INFO L85 PathProgramCache]: Analyzing trace with hash -474940204, now seen corresponding path program 1 times [2022-04-27 11:54:29,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:29,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329136037] [2022-04-27 11:54:29,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:29,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:54:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {17404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17337#true} is VALID [2022-04-27 11:54:29,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,291 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17337#true} {17337#true} #122#return; {17337#true} is VALID [2022-04-27 11:54:29,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #98#return; {17337#true} is VALID [2022-04-27 11:54:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:54:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17337#true} is VALID [2022-04-27 11:54:29,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,299 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17337#true} {17337#true} #100#return; {17337#true} is VALID [2022-04-27 11:54:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:54:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:54:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #116#return; {17337#true} is VALID [2022-04-27 11:54:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #118#return; {17337#true} is VALID [2022-04-27 11:54:29,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:54:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #120#return; {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L272 TraceCheckUtils]: 1: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 4: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {17337#true} {17337#true} #116#return; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17337#true} {17337#true} #118#return; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L272 TraceCheckUtils]: 11: Hoare triple {17337#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17337#true} {17337#true} #120#return; {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {17337#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17337#true} {17337#true} #102#return; {17337#true} is VALID [2022-04-27 11:54:29,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:54:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {17337#true} is VALID [2022-04-27 11:54:29,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} assume !(~j~1 < ~n); {17422#(<= finddup_~n (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {17422#(<= finddup_~n (+ finddup_~i~1 4))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {17423#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {17423#(<= finddup_~n (+ finddup_~i~1 3))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17426#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:54:29,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {17426#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17338#false} is VALID [2022-04-27 11:54:29,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {17338#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {17338#false} is VALID [2022-04-27 11:54:29,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,413 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17338#false} {17337#true} #104#return; {17338#false} is VALID [2022-04-27 11:54:29,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-04-27 11:54:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17338#false} #106#return; {17338#false} is VALID [2022-04-27 11:54:29,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-27 11:54:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17338#false} #108#return; {17338#false} is VALID [2022-04-27 11:54:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-04-27 11:54:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,420 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17338#false} #110#return; {17338#false} is VALID [2022-04-27 11:54:29,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {17337#true} call ULTIMATE.init(); {17404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:54:29,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {17404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #122#return; {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {17337#true} call #t~ret27 := main(); {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {17337#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L272 TraceCheckUtils]: 6: Hoare triple {17337#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,422 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17337#true} {17337#true} #98#return; {17337#true} is VALID [2022-04-27 11:54:29,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {17337#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {17337#true} is VALID [2022-04-27 11:54:29,423 INFO L272 TraceCheckUtils]: 12: Hoare triple {17337#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {17405#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:29,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17337#true} is VALID [2022-04-27 11:54:29,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,423 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17337#true} {17337#true} #100#return; {17337#true} is VALID [2022-04-27 11:54:29,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {17337#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L272 TraceCheckUtils]: 17: Hoare triple {17337#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {17405#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:29,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L272 TraceCheckUtils]: 19: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17337#true} {17337#true} #116#return; {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L272 TraceCheckUtils]: 24: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17337#true} {17337#true} #118#return; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L272 TraceCheckUtils]: 29: Hoare triple {17337#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17337#true} {17337#true} #120#return; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {17337#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17337#true} {17337#true} #102#return; {17337#true} is VALID [2022-04-27 11:54:29,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {17337#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {17337#true} is VALID [2022-04-27 11:54:29,427 INFO L272 TraceCheckUtils]: 38: Hoare triple {17337#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {17405#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:29,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {17405#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {17337#true} is VALID [2022-04-27 11:54:29,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {17337#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,432 INFO L290 TraceCheckUtils]: 50: Hoare triple {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} assume !(~j~1 < ~n); {17422#(<= finddup_~n (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {17422#(<= finddup_~n (+ finddup_~i~1 4))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {17423#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {17423#(<= finddup_~n (+ finddup_~i~1 3))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,433 INFO L290 TraceCheckUtils]: 53: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17426#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 59: Hoare triple {17426#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17338#false} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {17338#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {17338#false} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,436 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {17338#false} {17337#true} #104#return; {17338#false} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {17338#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {17338#false} is VALID [2022-04-27 11:54:29,436 INFO L272 TraceCheckUtils]: 64: Hoare triple {17338#false} call __VERIFIER_assert(~r~0); {17337#true} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 65: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 66: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,436 INFO L290 TraceCheckUtils]: 67: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,436 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17337#true} {17338#false} #106#return; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 69: Hoare triple {17338#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 70: Hoare triple {17338#false} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L272 TraceCheckUtils]: 71: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 72: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 73: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 74: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {17337#true} {17338#false} #108#return; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 76: Hoare triple {17338#false} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 77: Hoare triple {17338#false} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:29,437 INFO L272 TraceCheckUtils]: 78: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 79: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 80: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L290 TraceCheckUtils]: 81: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,437 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17337#true} {17338#false} #110#return; {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L290 TraceCheckUtils]: 83: Hoare triple {17338#false} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L272 TraceCheckUtils]: 84: Hoare triple {17338#false} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L290 TraceCheckUtils]: 85: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {17338#false} assume 0 == ~cond; {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L290 TraceCheckUtils]: 87: Hoare triple {17338#false} assume !false; {17338#false} is VALID [2022-04-27 11:54:29,438 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:54:29,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:29,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329136037] [2022-04-27 11:54:29,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329136037] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:54:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57929362] [2022-04-27 11:54:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:29,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:29,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:29,444 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:54:29,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-27 11:54:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:54:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:29,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:29,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {17337#true} call ULTIMATE.init(); {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #122#return; {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {17337#true} call #t~ret27 := main(); {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {17337#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L272 TraceCheckUtils]: 6: Hoare triple {17337#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17337#true} {17337#true} #98#return; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {17337#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L272 TraceCheckUtils]: 12: Hoare triple {17337#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {17337#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17337#true} {17337#true} #100#return; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {17337#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L272 TraceCheckUtils]: 17: Hoare triple {17337#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {17337#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17337#true} {17337#true} #116#return; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17337#true} {17337#true} #118#return; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L272 TraceCheckUtils]: 29: Hoare triple {17337#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17337#true} {17337#true} #120#return; {17337#true} is VALID [2022-04-27 11:54:29,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {17337#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17337#true} {17337#true} #102#return; {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {17337#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L272 TraceCheckUtils]: 38: Hoare triple {17337#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L290 TraceCheckUtils]: 39: Hoare triple {17337#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {17337#true} is VALID [2022-04-27 11:54:29,855 INFO L290 TraceCheckUtils]: 40: Hoare triple {17337#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:29,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,857 INFO L290 TraceCheckUtils]: 44: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:29,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} assume !(~j~1 < ~n); {17422#(<= finddup_~n (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:29,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {17422#(<= finddup_~n (+ finddup_~i~1 4))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {17423#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:29,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {17423#(<= finddup_~n (+ finddup_~i~1 3))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,862 INFO L290 TraceCheckUtils]: 54: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:29,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:29,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17426#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {17426#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 60: Hoare triple {17338#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {17338#false} {17337#true} #104#return; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {17338#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L272 TraceCheckUtils]: 64: Hoare triple {17338#false} call __VERIFIER_assert(~r~0); {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 66: Hoare triple {17338#false} assume !(0 == ~cond); {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17338#false} {17338#false} #106#return; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {17338#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {17338#false} is VALID [2022-04-27 11:54:29,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {17338#false} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L272 TraceCheckUtils]: 71: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 72: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 73: Hoare triple {17338#false} assume !(0 == ~cond); {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {17338#false} {17338#false} #108#return; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {17338#false} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {17338#false} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L272 TraceCheckUtils]: 78: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {17338#false} assume !(0 == ~cond); {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 81: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17338#false} {17338#false} #110#return; {17338#false} is VALID [2022-04-27 11:54:29,865 INFO L290 TraceCheckUtils]: 83: Hoare triple {17338#false} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {17338#false} is VALID [2022-04-27 11:54:29,866 INFO L272 TraceCheckUtils]: 84: Hoare triple {17338#false} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {17338#false} is VALID [2022-04-27 11:54:29,866 INFO L290 TraceCheckUtils]: 85: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:29,866 INFO L290 TraceCheckUtils]: 86: Hoare triple {17338#false} assume 0 == ~cond; {17338#false} is VALID [2022-04-27 11:54:29,866 INFO L290 TraceCheckUtils]: 87: Hoare triple {17338#false} assume !false; {17338#false} is VALID [2022-04-27 11:54:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-27 11:54:29,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:54:30,221 INFO L290 TraceCheckUtils]: 87: Hoare triple {17338#false} assume !false; {17338#false} is VALID [2022-04-27 11:54:30,221 INFO L290 TraceCheckUtils]: 86: Hoare triple {17338#false} assume 0 == ~cond; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 85: Hoare triple {17338#false} ~cond := #in~cond; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L272 TraceCheckUtils]: 84: Hoare triple {17338#false} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 83: Hoare triple {17338#false} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {17337#true} {17338#false} #110#return; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 81: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 80: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 79: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,222 INFO L272 TraceCheckUtils]: 78: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 77: Hoare triple {17338#false} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 76: Hoare triple {17338#false} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {17337#true} {17338#false} #108#return; {17338#false} is VALID [2022-04-27 11:54:30,222 INFO L290 TraceCheckUtils]: 74: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 72: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L272 TraceCheckUtils]: 71: Hoare triple {17338#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 70: Hoare triple {17338#false} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {17338#false} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 69: Hoare triple {17338#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {17338#false} is VALID [2022-04-27 11:54:30,223 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17337#true} {17338#false} #106#return; {17338#false} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 67: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 66: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L272 TraceCheckUtils]: 64: Hoare triple {17338#false} call __VERIFIER_assert(~r~0); {17337#true} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {17338#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {17338#false} is VALID [2022-04-27 11:54:30,223 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {17338#false} {17337#true} #104#return; {17338#false} is VALID [2022-04-27 11:54:30,223 INFO L290 TraceCheckUtils]: 61: Hoare triple {17338#false} assume true; {17338#false} is VALID [2022-04-27 11:54:30,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {17338#false} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {17338#false} is VALID [2022-04-27 11:54:30,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {17426#(<= finddup_~n finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17338#false} is VALID [2022-04-27 11:54:30,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17426#(<= finddup_~n finddup_~j~1)} is VALID [2022-04-27 11:54:30,225 INFO L290 TraceCheckUtils]: 57: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:30,225 INFO L290 TraceCheckUtils]: 56: Hoare triple {17425#(<= finddup_~n (+ finddup_~j~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:30,226 INFO L290 TraceCheckUtils]: 55: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17425#(<= finddup_~n (+ finddup_~j~1 1))} is VALID [2022-04-27 11:54:30,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:30,227 INFO L290 TraceCheckUtils]: 53: Hoare triple {17424#(<= finddup_~n (+ finddup_~j~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:30,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {17423#(<= finddup_~n (+ finddup_~i~1 3))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17424#(<= finddup_~n (+ finddup_~j~1 2))} is VALID [2022-04-27 11:54:30,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {17422#(<= finddup_~n (+ finddup_~i~1 4))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {17423#(<= finddup_~n (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:30,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} assume !(~j~1 < ~n); {17422#(<= finddup_~n (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:30,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17421#(<= finddup_~j~1 (+ finddup_~i~1 4))} is VALID [2022-04-27 11:54:30,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:30,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:30,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17420#(<= finddup_~j~1 (+ finddup_~i~1 3))} is VALID [2022-04-27 11:54:30,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:30,231 INFO L290 TraceCheckUtils]: 44: Hoare triple {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:30,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {17419#(<= finddup_~j~1 (+ finddup_~i~1 2))} is VALID [2022-04-27 11:54:30,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:30,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {17337#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {17418#(<= finddup_~j~1 (+ finddup_~i~1 1))} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {17337#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L272 TraceCheckUtils]: 38: Hoare triple {17337#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {17337#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17337#true} {17337#true} #102#return; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {17337#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {17337#true} {17337#true} #120#return; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,233 INFO L272 TraceCheckUtils]: 29: Hoare triple {17337#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {17337#true} {17337#true} #118#return; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 27: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L272 TraceCheckUtils]: 24: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17337#true} {17337#true} #116#return; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 22: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L272 TraceCheckUtils]: 19: Hoare triple {17337#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {17337#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L272 TraceCheckUtils]: 17: Hoare triple {17337#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {17337#true} is VALID [2022-04-27 11:54:30,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {17337#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17337#true} {17337#true} #100#return; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {17337#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L272 TraceCheckUtils]: 12: Hoare triple {17337#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {17337#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17337#true} {17337#true} #98#return; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {17337#true} assume !(0 == ~cond); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {17337#true} ~cond := #in~cond; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L272 TraceCheckUtils]: 6: Hoare triple {17337#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {17337#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {17337#true} call #t~ret27 := main(); {17337#true} is VALID [2022-04-27 11:54:30,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17337#true} {17337#true} #122#return; {17337#true} is VALID [2022-04-27 11:54:30,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {17337#true} assume true; {17337#true} is VALID [2022-04-27 11:54:30,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {17337#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17337#true} is VALID [2022-04-27 11:54:30,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {17337#true} call ULTIMATE.init(); {17337#true} is VALID [2022-04-27 11:54:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-27 11:54:30,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57929362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:54:30,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:54:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 13 [2022-04-27 11:54:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449977162] [2022-04-27 11:54:30,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:54:30,237 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2022-04-27 11:54:30,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:54:30,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-27 11:54:30,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:30,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:54:30,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:54:30,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:54:30,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:54:30,306 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-27 11:54:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:31,673 INFO L93 Difference]: Finished difference Result 208 states and 234 transitions. [2022-04-27 11:54:31,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:54:31,673 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2022-04-27 11:54:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:54:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-27 11:54:31,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2022-04-27 11:54:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-27 11:54:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2022-04-27 11:54:31,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 136 transitions. [2022-04-27 11:54:31,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:54:31,815 INFO L225 Difference]: With dead ends: 208 [2022-04-27 11:54:31,815 INFO L226 Difference]: Without dead ends: 134 [2022-04-27 11:54:31,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:54:31,816 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:54:31,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 60 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 11:54:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-27 11:54:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2022-04-27 11:54:32,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:54:32,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:32,215 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:32,215 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:32,218 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2022-04-27 11:54:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2022-04-27 11:54:32,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:32,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:32,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) Second operand 134 states. [2022-04-27 11:54:32,219 INFO L87 Difference]: Start difference. First operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) Second operand 134 states. [2022-04-27 11:54:32,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:54:32,222 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2022-04-27 11:54:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2022-04-27 11:54:32,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:54:32,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:54:32,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:54:32,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:54:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 98 states have internal predecessors, (106), 18 states have call successors, (18), 11 states have call predecessors, (18), 11 states have return successors, (16), 16 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-27 11:54:32,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2022-04-27 11:54:32,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 88 [2022-04-27 11:54:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:54:32,228 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2022-04-27 11:54:32,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (20), 4 states have call predecessors, (20), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-27 11:54:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2022-04-27 11:54:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-27 11:54:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:54:32,229 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:54:32,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-27 11:54:32,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:32,443 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:54:32,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:54:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1090519754, now seen corresponding path program 2 times [2022-04-27 11:54:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:54:32,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868566943] [2022-04-27 11:54:32,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:54:32,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:54:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:54:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {18789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18716#true} is VALID [2022-04-27 11:54:32,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18716#true} {18716#true} #122#return; {18716#true} is VALID [2022-04-27 11:54:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:32,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:32,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18716#true} #98#return; {18716#true} is VALID [2022-04-27 11:54:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:54:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:32,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:32,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {18716#true} #100#return; {18728#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:54:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:54:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:54:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:32,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:32,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:32,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:54:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:32,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:32,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:54:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:32,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:32,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:32,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:32,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {18805#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:54:32,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:32,969 INFO L272 TraceCheckUtils]: 1: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:32,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:32,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:32,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,970 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:32,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:32,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:32,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:32,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:32,971 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:32,971 INFO L272 TraceCheckUtils]: 11: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:32,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {18716#true} ~cond := #in~cond; {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:32,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:32,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:32,972 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {18805#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:54:32,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {18805#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:54:32,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:54:32,978 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} is VALID [2022-04-27 11:54:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:54:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:41,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {18809#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {18809#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {18810#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {18810#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18811#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:54:41,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {18811#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18812#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {18812#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18813#(and (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)))} is VALID [2022-04-27 11:54:41,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {18813#(and (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18814#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))))))} is VALID [2022-04-27 11:54:41,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {18814#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18815#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))))} is VALID [2022-04-27 11:54:41,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {18815#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18816#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:54:41,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {18816#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18817#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:54:41,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {18817#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18818#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:54:41,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {18818#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !(~j~1 < ~n); {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {18820#(or (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:54:41,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {18820#(or (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {18821#(and (or (and (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {18821#(and (or (and (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18822#(and (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) 0) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {18822#(and (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) 0) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18823#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {18823#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18824#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))))} is VALID [2022-04-27 11:54:41,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {18824#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18825#(and (or (and (or (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= (+ finddup_~i~1 2) finddup_~j~1))} is VALID [2022-04-27 11:54:41,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {18825#(and (or (and (or (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= (+ finddup_~i~1 2) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18826#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:54:41,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {18826#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18827#(and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (+ finddup_~a.offset (* finddup_~j~1 4)))))} is VALID [2022-04-27 11:54:41,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {18827#(and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (+ finddup_~a.offset (* finddup_~j~1 4)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18828#(or (not (= |finddup_#t~mem11| |finddup_#t~mem10|)) (and (= |#memory_int| |old(#memory_int)|) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:54:41,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {18828#(or (not (= |finddup_#t~mem11| |finddup_#t~mem10|)) (and (= |#memory_int| |old(#memory_int)|) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:54:41,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} assume true; {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:54:41,160 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} #104#return; {18717#false} is VALID [2022-04-27 11:54:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-04-27 11:54:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:41,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18717#false} #106#return; {18717#false} is VALID [2022-04-27 11:54:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-04-27 11:54:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:41,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18717#false} #108#return; {18717#false} is VALID [2022-04-27 11:54:41,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-04-27 11:54:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:41,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18717#false} #110#return; {18717#false} is VALID [2022-04-27 11:54:41,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {18716#true} call ULTIMATE.init(); {18789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {18789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18716#true} #122#return; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {18716#true} call #t~ret27 := main(); {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {18716#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L272 TraceCheckUtils]: 6: Hoare triple {18716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18716#true} {18716#true} #98#return; {18716#true} is VALID [2022-04-27 11:54:41,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {18716#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {18716#true} is VALID [2022-04-27 11:54:41,180 INFO L272 TraceCheckUtils]: 12: Hoare triple {18716#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {18790#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:41,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:41,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:41,181 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {18716#true} #100#return; {18728#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:54:41,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {18728#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:54:41,182 INFO L272 TraceCheckUtils]: 17: Hoare triple {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {18790#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:41,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:41,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #116#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:41,184 INFO L272 TraceCheckUtils]: 24: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,184 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18716#true} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #118#return; {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} is VALID [2022-04-27 11:54:41,184 INFO L272 TraceCheckUtils]: 29: Hoare triple {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {18716#true} ~cond := #in~cond; {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:41,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:41,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:41,186 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} {18792#(or (and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|)) (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset)))} #120#return; {18805#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} is VALID [2022-04-27 11:54:41,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {18805#(and (= |#memory_int| |old(#memory_int)|) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= (+ mkdup_~a.offset (* mkdup_~i~0 4)) (+ (* mkdup_~j~0 4) mkdup_~a.offset))))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:54:41,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} assume true; {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} is VALID [2022-04-27 11:54:41,192 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18806#(and (or (= (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (and (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))) 0)) (= (select |#memory_int| |mkdup_#in~a.base|) (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|))))))) (or (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |#memory_int| |mkdup_#in~a.base|) ((as const (Array Int Int)) 0)) 0))) (= 0 (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))) (select |#memory_int| |mkdup_#in~a.base|)))) (= (select |#memory_int| |mkdup_#in~a.base|) (store (select |old(#memory_int)| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)) (select (select |#memory_int| |mkdup_#in~a.base|) (@diff (select |old(#memory_int)| |mkdup_#in~a.base|) (select |#memory_int| |mkdup_#in~a.base|)))))))} {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} is VALID [2022-04-27 11:54:41,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} is VALID [2022-04-27 11:54:41,194 INFO L272 TraceCheckUtils]: 38: Hoare triple {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {18790#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:41,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {18809#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {18809#(and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {18810#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,195 INFO L290 TraceCheckUtils]: 41: Hoare triple {18810#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18811#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:54:41,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {18811#(and (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18812#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {18812#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18813#(and (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)))} is VALID [2022-04-27 11:54:41,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {18813#(and (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))) (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18814#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))))))} is VALID [2022-04-27 11:54:41,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {18814#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0))))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18815#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))))} is VALID [2022-04-27 11:54:41,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {18815#(and (= |#memory_int| |old(#memory_int)|) (<= (+ finddup_~i~1 2) finddup_~j~1) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 2)) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (or (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18816#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:54:41,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {18816#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18817#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} is VALID [2022-04-27 11:54:41,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {18817#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 2)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 1))) (and (<= (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) (+ finddup_~i~1 1)) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (<= (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) (+ finddup_~i~1 2))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18818#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} is VALID [2022-04-27 11:54:41,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {18818#(and (= |#memory_int| |old(#memory_int)|) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (<= finddup_~j~1 (+ finddup_~i~1 3)) (<= (+ finddup_~i~1 3) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,212 INFO L290 TraceCheckUtils]: 52: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} assume !(~j~1 < ~n); {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:54:41,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {18819#(and (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {18820#(or (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:54:41,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {18820#(or (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 1) finddup_~i~1)) (and (<= (+ (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4) 1) finddup_~i~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))))) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {18821#(and (or (and (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {18821#(and (or (and (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (and (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18822#(and (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) 0) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {18822#(and (or (and (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) 0) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0)) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0) (and (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))) (or (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#t~mem11| |finddup_#t~mem10|)) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))) (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))) 0) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base))) (<= (+ finddup_~i~1 1) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18823#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))) (<= (+ finddup_~i~1 1) finddup_~j~1))} is VALID [2022-04-27 11:54:41,225 INFO L290 TraceCheckUtils]: 58: Hoare triple {18823#(and (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (and (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0))) (or (and (<= (+ 2 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0)) (and (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (<= (+ 2 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4) 4) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))) (<= (+ finddup_~i~1 1) finddup_~j~1))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18824#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))))} is VALID [2022-04-27 11:54:41,228 INFO L290 TraceCheckUtils]: 59: Hoare triple {18824#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (or (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18825#(and (or (and (or (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= (+ finddup_~i~1 2) finddup_~j~1))} is VALID [2022-04-27 11:54:41,230 INFO L290 TraceCheckUtils]: 60: Hoare triple {18825#(and (or (and (or (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |finddup_#t~mem11| 0) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (select |#memory_int| finddup_~a.base)))) (and (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))))) (<= (+ finddup_~i~1 2) finddup_~j~1))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18826#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#in~a.base| finddup_~a.base))))} is VALID [2022-04-27 11:54:41,231 INFO L290 TraceCheckUtils]: 61: Hoare triple {18826#(and (<= (+ finddup_~i~1 2) finddup_~j~1) (or (and (or (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0)))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |#memory_int| |old(#memory_int)|) (= |finddup_#in~a.base| finddup_~a.base)) (and (or (and (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (= (mod (+ (* finddup_~a.offset 3) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4) 0) (<= (+ 3 (div (+ (* (- 1) finddup_~a.offset) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* (- 1) finddup_~a.offset)) 4)) finddup_~j~1) (= (mod (+ (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) (* finddup_~a.offset 3)) 4) 0) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (= |finddup_#in~a.base| finddup_~a.base))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18827#(and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (+ finddup_~a.offset (* finddup_~j~1 4)))))} is VALID [2022-04-27 11:54:41,235 INFO L290 TraceCheckUtils]: 62: Hoare triple {18827#(and (= |#memory_int| |old(#memory_int)|) (or (and (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= ((as const (Array Int Int)) 0) (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0))) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0))))) (and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) 0)) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)))) (not (= (+ finddup_~a.offset (* finddup_~j~1 4)) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0))))) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| finddup_~a.base) (@diff (select |#memory_int| finddup_~a.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))) (= |finddup_#in~a.base| finddup_~a.base) (not (= (+ finddup_~a.offset (* finddup_~i~1 4)) (+ finddup_~a.offset (* finddup_~j~1 4)))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18828#(or (not (= |finddup_#t~mem11| |finddup_#t~mem10|)) (and (= |#memory_int| |old(#memory_int)|) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} is VALID [2022-04-27 11:54:41,236 INFO L290 TraceCheckUtils]: 63: Hoare triple {18828#(or (not (= |finddup_#t~mem11| |finddup_#t~mem10|)) (and (= |#memory_int| |old(#memory_int)|) (not (= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| |finddup_#in~a.base|) (@diff (select |#memory_int| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:54:41,237 INFO L290 TraceCheckUtils]: 64: Hoare triple {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} assume true; {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} is VALID [2022-04-27 11:54:41,238 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {18829#(not (= ((as const (Array Int Int)) 0) (store (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |old(#memory_int)| |finddup_#in~a.base|) (@diff (select |old(#memory_int)| |finddup_#in~a.base|) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0)))} {18749#(= ((as const (Array Int Int)) 0) (store (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) (@diff (store (select |#memory_int| main_~a~0.base) (@diff (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0)) 0) ((as const (Array Int Int)) 0)) 0))} #104#return; {18717#false} is VALID [2022-04-27 11:54:41,238 INFO L290 TraceCheckUtils]: 66: Hoare triple {18717#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {18717#false} is VALID [2022-04-27 11:54:41,238 INFO L272 TraceCheckUtils]: 67: Hoare triple {18717#false} call __VERIFIER_assert(~r~0); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 69: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 70: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18716#true} {18717#false} #106#return; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 72: Hoare triple {18717#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 73: Hoare triple {18717#false} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L272 TraceCheckUtils]: 74: Hoare triple {18717#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 75: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 76: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 77: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18716#true} {18717#false} #108#return; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 79: Hoare triple {18717#false} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 80: Hoare triple {18717#false} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {18717#false} is VALID [2022-04-27 11:54:41,239 INFO L272 TraceCheckUtils]: 81: Hoare triple {18717#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 82: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 83: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L290 TraceCheckUtils]: 84: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:41,239 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18716#true} {18717#false} #110#return; {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L290 TraceCheckUtils]: 86: Hoare triple {18717#false} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L272 TraceCheckUtils]: 87: Hoare triple {18717#false} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L290 TraceCheckUtils]: 88: Hoare triple {18717#false} ~cond := #in~cond; {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L290 TraceCheckUtils]: 89: Hoare triple {18717#false} assume 0 == ~cond; {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L290 TraceCheckUtils]: 90: Hoare triple {18717#false} assume !false; {18717#false} is VALID [2022-04-27 11:54:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 19 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-27 11:54:41,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:54:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868566943] [2022-04-27 11:54:41,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868566943] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:54:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330731120] [2022-04-27 11:54:41,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 11:54:41,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:54:41,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:54:41,243 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:54:41,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-27 11:54:41,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 11:54:41,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 11:54:41,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-27 11:54:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:54:41,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:54:41,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2022-04-27 11:54:43,763 WARN L855 $PredicateComparison]: unable to prove that (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (not (= mkdup_~j~0 mkdup_~i~0)) (= (store |c_old(#memory_int)| |c_mkdup_#in~a.base| (store (store (select |c_old(#memory_int)| |c_mkdup_#in~a.base|) (+ |c_mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ (* mkdup_~j~0 4) |c_mkdup_#in~a.offset|) mkdup_~x~0)) |c_#memory_int|) (< mkdup_~i~0 |c_mkdup_#in~n|) (<= 0 mkdup_~i~0))) is different from true [2022-04-27 11:54:43,996 INFO L390 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 29 treesize of output 24 [2022-04-27 11:54:58,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {18716#true} call ULTIMATE.init(); {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {18716#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18716#true} {18716#true} #122#return; {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {18716#true} call #t~ret27 := main(); {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {18716#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {18716#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:58,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:58,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:58,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18716#true} {18716#true} #98#return; {18716#true} is VALID [2022-04-27 11:54:58,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {18716#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {18716#true} is VALID [2022-04-27 11:54:58,028 INFO L272 TraceCheckUtils]: 12: Hoare triple {18716#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {18716#true} is VALID [2022-04-27 11:54:58,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {18716#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:58,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} assume true; {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} is VALID [2022-04-27 11:54:58,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {18791#(= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|))} {18716#true} #100#return; {18728#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} is VALID [2022-04-27 11:54:58,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {18728#(= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc13.base|))} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} is VALID [2022-04-27 11:54:58,034 INFO L272 TraceCheckUtils]: 17: Hoare triple {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {18790#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:54:58,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {18887#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} is VALID [2022-04-27 11:54:58,035 INFO L272 TraceCheckUtils]: 19: Hoare triple {18887#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:58,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {18716#true} ~cond := #in~cond; {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:58,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:58,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:58,037 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} {18887#(and (<= mkdup_~n |mkdup_#in~n|) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))} #116#return; {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:54:58,037 INFO L272 TraceCheckUtils]: 24: Hoare triple {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:58,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {18716#true} ~cond := #in~cond; {18716#true} is VALID [2022-04-27 11:54:58,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {18716#true} assume !(0 == ~cond); {18716#true} is VALID [2022-04-27 11:54:58,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {18716#true} assume true; {18716#true} is VALID [2022-04-27 11:54:58,038 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18716#true} {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} #118#return; {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:54:58,038 INFO L272 TraceCheckUtils]: 29: Hoare triple {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {18716#true} is VALID [2022-04-27 11:54:58,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {18716#true} ~cond := #in~cond; {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:54:58,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {18807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:58,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {18808#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:54:58,040 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {18808#(not (= |assume_abort_if_not_#in~cond| 0))} {18903#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} #120#return; {18934#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} is VALID [2022-04-27 11:55:00,051 WARN L290 TraceCheckUtils]: 34: Hoare triple {18934#(and (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {18938#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:55:01,825 WARN L290 TraceCheckUtils]: 35: Hoare triple {18938#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|)))} assume true; {18938#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|)))} is UNKNOWN [2022-04-27 11:55:03,787 WARN L284 TraceCheckUtils]: 36: Hoare quadruple {18938#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (= (store |old(#memory_int)| |mkdup_#in~a.base| (store (store (select |old(#memory_int)| |mkdup_#in~a.base|) (+ |mkdup_#in~a.offset| (* mkdup_~i~0 4)) mkdup_~x~0) (+ |mkdup_#in~a.offset| (* mkdup_~j~0 4)) mkdup_~x~0)) |#memory_int|) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|)))} {18729#(= (select |#memory_int| main_~a~0.base) ((as const (Array Int Int)) 0))} #102#return; {18945#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 main_~n~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:55:05,552 WARN L290 TraceCheckUtils]: 37: Hoare triple {18945#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 main_~n~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {18945#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 main_~n~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} is UNKNOWN [2022-04-27 11:55:05,554 INFO L272 TraceCheckUtils]: 38: Hoare triple {18945#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 main_~n~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {18790#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:55:05,554 INFO L290 TraceCheckUtils]: 39: Hoare triple {18790#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {18955#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:55:05,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {18955#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {18959#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:55:05,555 INFO L290 TraceCheckUtils]: 41: Hoare triple {18959#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18963#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} is VALID [2022-04-27 11:55:05,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {18963#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18967#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} is VALID [2022-04-27 11:55:05,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {18967#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18971#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:55:05,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {18971#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18975#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:55:05,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {18975#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18979#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} is VALID [2022-04-27 11:55:05,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {18979#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18983#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {18983#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18987#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {18987#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {18991#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {18991#(and (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= finddup_~j~1 (+ finddup_~i~1 3)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {18995#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} is VALID [2022-04-27 11:55:05,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {18995#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {18999#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} is VALID [2022-04-27 11:55:05,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {18999#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19003#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} is VALID [2022-04-27 11:55:05,563 INFO L290 TraceCheckUtils]: 52: Hoare triple {19003#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (= finddup_~j~1 (+ finddup_~i~1 4)))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19007#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 5)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 16 (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,564 INFO L290 TraceCheckUtils]: 53: Hoare triple {19007#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= |finddup_#in~n| finddup_~n) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (<= finddup_~j~1 (+ finddup_~i~1 5)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 16 (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} assume !(~j~1 < ~n); {19011#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 16 (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 5)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {19011#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)))) (<= finddup_~i~1 0) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset 16 (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= |finddup_#in~n| (+ finddup_~i~1 5)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19015#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,566 INFO L290 TraceCheckUtils]: 55: Hoare triple {19015#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19019#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,566 INFO L290 TraceCheckUtils]: 56: Hoare triple {19019#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19023#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,567 INFO L290 TraceCheckUtils]: 57: Hoare triple {19023#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19027#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,568 INFO L290 TraceCheckUtils]: 58: Hoare triple {19027#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= finddup_~j~1 (+ finddup_~i~1 1)) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19031#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {19031#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19035#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,570 INFO L290 TraceCheckUtils]: 60: Hoare triple {19035#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= |finddup_#t~mem11| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4)))) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (= |finddup_#t~mem10| (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4)))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19039#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {19039#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 1)) (+ finddup_~i~1 1)) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))))} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19043#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 2)) (+ finddup_~i~1 1)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 8))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} is VALID [2022-04-27 11:55:05,573 INFO L290 TraceCheckUtils]: 62: Hoare triple {19043#(and (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 4)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (= (+ finddup_~j~1 (- 2)) (+ finddup_~i~1 1)) (= |#memory_int| |old(#memory_int)|) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))) (<= finddup_~i~1 1) (<= |finddup_#in~n| (+ finddup_~i~1 4)) (= finddup_~a.offset |finddup_#in~a.offset|) (= |finddup_#in~a.base| finddup_~a.base) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 12)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4) 8)) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (- 4) (* finddup_~i~1 4))))) (not (= (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~j~1 4) (- 8))) (select (select |#memory_int| finddup_~a.base) (+ finddup_~a.offset (* finddup_~i~1 4))))))} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19047#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) |finddup_#t~mem11|) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} is VALID [2022-04-27 11:55:05,577 INFO L290 TraceCheckUtils]: 63: Hoare triple {19047#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) |finddup_#t~mem11|) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (= |finddup_#t~mem10| (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} assume #t~mem10 == #t~mem11;havoc #t~mem10;havoc #t~mem11;call write~int(~i~1, ~_i.base, ~_i.offset, 4);call write~int(~j~1, ~_j.base, ~_j.offset, 4);#res := 1; {19051#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} is VALID [2022-04-27 11:55:05,579 INFO L290 TraceCheckUtils]: 64: Hoare triple {19051#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} assume true; {19051#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} is VALID [2022-04-27 11:55:05,581 INFO L284 TraceCheckUtils]: 65: Hoare quadruple {19051#(exists ((finddup_~j~1 Int)) (and (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))))) (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12)))) (<= finddup_~j~1 4) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 8))))) (<= |finddup_#in~n| (+ finddup_~j~1 1)) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 12))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|)))) (not (= (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) |finddup_#in~a.offset| (- 4))) (select (select |old(#memory_int)| |finddup_#in~a.base|) (+ (* finddup_~j~1 4) (- 16) |finddup_#in~a.offset|))))))} {18945#(exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~i~0 main_~n~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0)))} #104#return; {18717#false} is VALID [2022-04-27 11:55:05,581 INFO L290 TraceCheckUtils]: 66: Hoare triple {18717#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L272 TraceCheckUtils]: 67: Hoare triple {18717#false} call __VERIFIER_assert(~r~0); {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 68: Hoare triple {18717#false} ~cond := #in~cond; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 69: Hoare triple {18717#false} assume !(0 == ~cond); {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 70: Hoare triple {18717#false} assume true; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18717#false} {18717#false} #106#return; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 72: Hoare triple {18717#false} call #t~mem15 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := 0 <= #t~mem15; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 73: Hoare triple {18717#false} assume #t~short17;call #t~mem16 := read~int(~#i~2.base, ~#i~2.offset, 4);#t~short17 := #t~mem16 < ~n~0; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L272 TraceCheckUtils]: 74: Hoare triple {18717#false} call __VERIFIER_assert((if #t~short17 then 1 else 0)); {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 75: Hoare triple {18717#false} ~cond := #in~cond; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 76: Hoare triple {18717#false} assume !(0 == ~cond); {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 77: Hoare triple {18717#false} assume true; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {18717#false} {18717#false} #108#return; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 79: Hoare triple {18717#false} havoc #t~mem15;havoc #t~mem16;havoc #t~short17;call #t~mem18 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := 0 <= #t~mem18; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 80: Hoare triple {18717#false} assume #t~short20;call #t~mem19 := read~int(~#j~2.base, ~#j~2.offset, 4);#t~short20 := #t~mem19 < ~n~0; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L272 TraceCheckUtils]: 81: Hoare triple {18717#false} call __VERIFIER_assert((if #t~short20 then 1 else 0)); {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 82: Hoare triple {18717#false} ~cond := #in~cond; {18717#false} is VALID [2022-04-27 11:55:05,582 INFO L290 TraceCheckUtils]: 83: Hoare triple {18717#false} assume !(0 == ~cond); {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L290 TraceCheckUtils]: 84: Hoare triple {18717#false} assume true; {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18717#false} {18717#false} #110#return; {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L290 TraceCheckUtils]: 86: Hoare triple {18717#false} havoc #t~mem18;havoc #t~mem19;havoc #t~short20;call #t~mem21 := read~int(~#i~2.base, ~#i~2.offset, 4);call #t~mem22 := read~int(~#j~2.base, ~#j~2.offset, 4); {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L272 TraceCheckUtils]: 87: Hoare triple {18717#false} call __VERIFIER_assert((if #t~mem21 != #t~mem22 then 1 else 0)); {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L290 TraceCheckUtils]: 88: Hoare triple {18717#false} ~cond := #in~cond; {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L290 TraceCheckUtils]: 89: Hoare triple {18717#false} assume 0 == ~cond; {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L290 TraceCheckUtils]: 90: Hoare triple {18717#false} assume !false; {18717#false} is VALID [2022-04-27 11:55:05,583 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 9 proven. 68 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 11:55:05,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:55:06,223 WARN L804 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2022-04-27 11:55:06,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330731120] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:55:06,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:55:06,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 64 [2022-04-27 11:55:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772911046] [2022-04-27 11:55:06,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 11:55:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) Word has length 91 [2022-04-27 11:55:06,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:06,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-27 11:55:13,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 126 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:13,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-27 11:55:13,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:13,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-27 11:55:13,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=395, Invalid=3636, Unknown=5, NotChecked=124, Total=4160 [2022-04-27 11:55:13,259 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-27 11:55:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:49,210 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2022-04-27 11:55:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-27 11:55:49,210 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) Word has length 91 [2022-04-27 11:55:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-27 11:55:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 143 transitions. [2022-04-27 11:55:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-27 11:55:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 143 transitions. [2022-04-27 11:55:49,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 143 transitions. [2022-04-27 11:55:56,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 139 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:56,741 INFO L225 Difference]: With dead ends: 150 [2022-04-27 11:55:56,741 INFO L226 Difference]: Without dead ends: 118 [2022-04-27 11:55:56,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4220 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=1170, Invalid=12392, Unknown=14, NotChecked=230, Total=13806 [2022-04-27 11:55:56,742 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 162 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 2190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:56,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 125 Invalid, 2190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1708 Invalid, 0 Unknown, 320 Unchecked, 3.0s Time] [2022-04-27 11:55:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-27 11:55:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2022-04-27 11:55:57,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:57,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:55:57,091 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:55:57,091 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:55:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:57,093 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-27 11:55:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-27 11:55:57,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:57,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:57,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 118 states. [2022-04-27 11:55:57,094 INFO L87 Difference]: Start difference. First operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 118 states. [2022-04-27 11:55:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:57,096 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2022-04-27 11:55:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2022-04-27 11:55:57,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:57,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:57,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:57,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.1) internal successors, (88), 81 states have internal predecessors, (88), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 11:55:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-04-27 11:55:57,098 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 91 [2022-04-27 11:55:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:57,099 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-04-27 11:55:57,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 58 states have internal predecessors, (89), 8 states have call successors, (22), 4 states have call predecessors, (22), 8 states have return successors, (19), 9 states have call predecessors, (19), 8 states have call successors, (19) [2022-04-27 11:55:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-04-27 11:55:57,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-27 11:55:57,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:55:57,100 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:55:57,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-27 11:55:57,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-27 11:55:57,323 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:55:57,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:55:57,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1526713043, now seen corresponding path program 7 times [2022-04-27 11:55:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:55:57,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815717612] [2022-04-27 11:55:57,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:55:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:55:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:55:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {19984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19909#true} is VALID [2022-04-27 11:55:57,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19909#true} {19909#true} #122#return; {19909#true} is VALID [2022-04-27 11:55:57,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:55:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #98#return; {19909#true} is VALID [2022-04-27 11:55:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 11:55:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19909#true} is VALID [2022-04-27 11:55:57,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,367 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19909#true} {19909#true} #100#return; {19909#true} is VALID [2022-04-27 11:55:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 11:55:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-27 11:55:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #116#return; {19909#true} is VALID [2022-04-27 11:55:57,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:55:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #118#return; {19909#true} is VALID [2022-04-27 11:55:57,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 11:55:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #120#return; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L272 TraceCheckUtils]: 1: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {19909#true} {19909#true} #116#return; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L272 TraceCheckUtils]: 6: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19909#true} {19909#true} #118#return; {19909#true} is VALID [2022-04-27 11:55:57,380 INFO L272 TraceCheckUtils]: 11: Hoare triple {19909#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19909#true} {19909#true} #120#return; {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19909#true} {19909#true} #102#return; {19909#true} is VALID [2022-04-27 11:55:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-04-27 11:55:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {19909#true} assume !(~j~1 < ~n); {19909#true} is VALID [2022-04-27 11:55:57,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {19909#true} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19909#true} is VALID [2022-04-27 11:55:57,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:57,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20002#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:55:57,464 INFO L290 TraceCheckUtils]: 28: Hoare triple {20002#(<= (+ finddup_~i~1 3) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,465 INFO L290 TraceCheckUtils]: 29: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20004#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {20004#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 35: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:57,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {19910#false} assume !(~i~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {19910#false} #res := 0; {19910#false} is VALID [2022-04-27 11:55:57,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {19910#false} assume true; {19910#false} is VALID [2022-04-27 11:55:57,467 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {19910#false} {19909#true} #104#return; {19910#false} is VALID [2022-04-27 11:55:57,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {19909#true} call ULTIMATE.init(); {19984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {19984#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #122#return; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {19909#true} call #t~ret27 := main(); {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {19909#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L272 TraceCheckUtils]: 6: Hoare triple {19909#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19909#true} {19909#true} #98#return; {19909#true} is VALID [2022-04-27 11:55:57,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {19909#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {19909#true} is VALID [2022-04-27 11:55:57,469 INFO L272 TraceCheckUtils]: 12: Hoare triple {19909#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {19985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:55:57,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19909#true} is VALID [2022-04-27 11:55:57,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,470 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19909#true} {19909#true} #100#return; {19909#true} is VALID [2022-04-27 11:55:57,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {19909#true} is VALID [2022-04-27 11:55:57,470 INFO L272 TraceCheckUtils]: 17: Hoare triple {19909#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {19985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:55:57,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {19909#true} is VALID [2022-04-27 11:55:57,470 INFO L272 TraceCheckUtils]: 19: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19909#true} {19909#true} #116#return; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L272 TraceCheckUtils]: 24: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {19909#true} {19909#true} #118#return; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L272 TraceCheckUtils]: 29: Hoare triple {19909#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,472 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {19909#true} {19909#true} #120#return; {19909#true} is VALID [2022-04-27 11:55:57,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {19909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {19909#true} is VALID [2022-04-27 11:55:57,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,472 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19909#true} {19909#true} #102#return; {19909#true} is VALID [2022-04-27 11:55:57,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {19909#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L272 TraceCheckUtils]: 38: Hoare triple {19909#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {19985#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {19985#(= |#memory_int| |old(#memory_int)|)} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {19909#true} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {19909#true} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {19909#true} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {19909#true} assume !(~j~1 < ~n); {19909#true} is VALID [2022-04-27 11:55:57,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {19909#true} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19909#true} is VALID [2022-04-27 11:55:57,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,476 INFO L290 TraceCheckUtils]: 58: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:57,478 INFO L290 TraceCheckUtils]: 62: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,478 INFO L290 TraceCheckUtils]: 63: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,479 INFO L290 TraceCheckUtils]: 64: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,479 INFO L290 TraceCheckUtils]: 65: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,480 INFO L290 TraceCheckUtils]: 66: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20002#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:55:57,480 INFO L290 TraceCheckUtils]: 67: Hoare triple {20002#(<= (+ finddup_~i~1 3) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,481 INFO L290 TraceCheckUtils]: 68: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,482 INFO L290 TraceCheckUtils]: 70: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20004#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:55:57,482 INFO L290 TraceCheckUtils]: 71: Hoare triple {20004#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,482 INFO L290 TraceCheckUtils]: 72: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,482 INFO L290 TraceCheckUtils]: 73: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:57,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 75: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 76: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 77: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 78: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 79: Hoare triple {19910#false} assume !(~i~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 80: Hoare triple {19910#false} #res := 0; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 81: Hoare triple {19910#false} assume true; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {19910#false} {19909#true} #104#return; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 83: Hoare triple {19910#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L272 TraceCheckUtils]: 84: Hoare triple {19910#false} call __VERIFIER_assert(~r~0); {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {19910#false} ~cond := #in~cond; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {19910#false} assume 0 == ~cond; {19910#false} is VALID [2022-04-27 11:55:57,483 INFO L290 TraceCheckUtils]: 87: Hoare triple {19910#false} assume !false; {19910#false} is VALID [2022-04-27 11:55:57,484 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 107 proven. 22 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-04-27 11:55:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:55:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815717612] [2022-04-27 11:55:57,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815717612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:55:57,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179670258] [2022-04-27 11:55:57,484 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-27 11:55:57,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:57,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:55:57,488 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 11:55:57,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-27 11:55:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:55:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:55:57,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:55:57,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {19909#true} call ULTIMATE.init(); {19909#true} is VALID [2022-04-27 11:55:57,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19909#true} is VALID [2022-04-27 11:55:57,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #122#return; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {19909#true} call #t~ret27 := main(); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {19909#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L272 TraceCheckUtils]: 6: Hoare triple {19909#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19909#true} {19909#true} #98#return; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {19909#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L272 TraceCheckUtils]: 12: Hoare triple {19909#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {19909#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,985 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19909#true} {19909#true} #100#return; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L272 TraceCheckUtils]: 17: Hoare triple {19909#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {19909#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L272 TraceCheckUtils]: 19: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19909#true} {19909#true} #116#return; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L272 TraceCheckUtils]: 24: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,986 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {19909#true} {19909#true} #118#return; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L272 TraceCheckUtils]: 29: Hoare triple {19909#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 32: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {19909#true} {19909#true} #120#return; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {19909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19909#true} {19909#true} #102#return; {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {19909#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L272 TraceCheckUtils]: 38: Hoare triple {19909#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {19909#true} is VALID [2022-04-27 11:55:57,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {19909#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {19909#true} is VALID [2022-04-27 11:55:57,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:57,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:57,990 INFO L290 TraceCheckUtils]: 46: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:57,991 INFO L290 TraceCheckUtils]: 47: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:57,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:57,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20155#(<= (+ finddup_~i~1 4) finddup_~j~1)} is VALID [2022-04-27 11:55:57,992 INFO L290 TraceCheckUtils]: 50: Hoare triple {20155#(<= (+ finddup_~i~1 4) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,994 INFO L290 TraceCheckUtils]: 55: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,995 INFO L290 TraceCheckUtils]: 57: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,995 INFO L290 TraceCheckUtils]: 58: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,995 INFO L290 TraceCheckUtils]: 59: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,996 INFO L290 TraceCheckUtils]: 61: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,996 INFO L290 TraceCheckUtils]: 62: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,997 INFO L290 TraceCheckUtils]: 64: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:57,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20002#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:55:57,998 INFO L290 TraceCheckUtils]: 67: Hoare triple {20002#(<= (+ finddup_~i~1 3) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:57,999 INFO L290 TraceCheckUtils]: 69: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:58,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20004#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:55:58,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {20004#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,000 INFO L290 TraceCheckUtils]: 73: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 76: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 77: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 78: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 79: Hoare triple {19910#false} assume !(~i~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {19910#false} #res := 0; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {19910#false} assume true; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {19910#false} {19909#true} #104#return; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 83: Hoare triple {19910#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L272 TraceCheckUtils]: 84: Hoare triple {19910#false} call __VERIFIER_assert(~r~0); {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {19910#false} ~cond := #in~cond; {19910#false} is VALID [2022-04-27 11:55:58,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {19910#false} assume 0 == ~cond; {19910#false} is VALID [2022-04-27 11:55:58,002 INFO L290 TraceCheckUtils]: 87: Hoare triple {19910#false} assume !false; {19910#false} is VALID [2022-04-27 11:55:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 11:55:58,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {19910#false} assume !false; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 86: Hoare triple {19910#false} assume 0 == ~cond; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 85: Hoare triple {19910#false} ~cond := #in~cond; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L272 TraceCheckUtils]: 84: Hoare triple {19910#false} call __VERIFIER_assert(~r~0); {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {19910#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~r~0 := #t~ret14;havoc #t~ret14; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {19910#false} {19909#true} #104#return; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 81: Hoare triple {19910#false} assume true; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 80: Hoare triple {19910#false} #res := 0; {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 79: Hoare triple {19910#false} assume !(~i~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,325 INFO L290 TraceCheckUtils]: 78: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 77: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 76: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 75: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 74: Hoare triple {19910#false} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 73: Hoare triple {19910#false} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 72: Hoare triple {19910#false} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {19910#false} is VALID [2022-04-27 11:55:58,326 INFO L290 TraceCheckUtils]: 71: Hoare triple {20004#(<= (+ finddup_~j~1 1) finddup_~n)} assume !(~j~1 < ~n); {19910#false} is VALID [2022-04-27 11:55:58,327 INFO L290 TraceCheckUtils]: 70: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20004#(<= (+ finddup_~j~1 1) finddup_~n)} is VALID [2022-04-27 11:55:58,327 INFO L290 TraceCheckUtils]: 69: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:58,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {20003#(<= (+ finddup_~j~1 2) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:58,328 INFO L290 TraceCheckUtils]: 67: Hoare triple {20002#(<= (+ finddup_~i~1 3) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20003#(<= (+ finddup_~j~1 2) finddup_~n)} is VALID [2022-04-27 11:55:58,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20002#(<= (+ finddup_~i~1 3) finddup_~n)} is VALID [2022-04-27 11:55:58,329 INFO L290 TraceCheckUtils]: 65: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,329 INFO L290 TraceCheckUtils]: 64: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,329 INFO L290 TraceCheckUtils]: 63: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,329 INFO L290 TraceCheckUtils]: 62: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,330 INFO L290 TraceCheckUtils]: 61: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,330 INFO L290 TraceCheckUtils]: 60: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,331 INFO L290 TraceCheckUtils]: 56: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {20001#(<= (+ finddup_~i~1 4) finddup_~n)} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,332 INFO L290 TraceCheckUtils]: 54: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} #t~post8 := ~i~1;~i~1 := 1 + #t~post8;havoc #t~post8; {20001#(<= (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,332 INFO L290 TraceCheckUtils]: 53: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} assume !(~j~1 < ~n); {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,332 INFO L290 TraceCheckUtils]: 52: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,332 INFO L290 TraceCheckUtils]: 51: Hoare triple {20159#(< (+ finddup_~i~1 4) finddup_~n)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {20155#(<= (+ finddup_~i~1 4) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20159#(< (+ finddup_~i~1 4) finddup_~n)} is VALID [2022-04-27 11:55:58,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20155#(<= (+ finddup_~i~1 4) finddup_~j~1)} is VALID [2022-04-27 11:55:58,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:58,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:58,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {20000#(<= (+ finddup_~i~1 3) finddup_~j~1)} is VALID [2022-04-27 11:55:58,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:58,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:58,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} #t~post9 := ~j~1;~j~1 := 1 + #t~post9;havoc #t~post9; {19999#(<= (+ finddup_~i~1 2) finddup_~j~1)} is VALID [2022-04-27 11:55:58,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !(#t~mem10 == #t~mem11);havoc #t~mem10;havoc #t~mem11; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:58,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} assume !!(~j~1 < ~n);call #t~mem10 := read~int(~a.base, ~a.offset + 4 * ~i~1, 4);call #t~mem11 := read~int(~a.base, ~a.offset + 4 * ~j~1, 4); {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:58,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {19909#true} assume !!(~i~1 < ~n);~j~1 := 1 + ~i~1; {19998#(<= (+ finddup_~i~1 1) finddup_~j~1)} is VALID [2022-04-27 11:55:58,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {19909#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~_i.base, ~_i.offset := #in~_i.base, #in~_i.offset;~_j.base, ~_j.offset := #in~_j.base, #in~_j.offset;havoc ~i~1;havoc ~j~1;~i~1 := 0; {19909#true} is VALID [2022-04-27 11:55:58,336 INFO L272 TraceCheckUtils]: 38: Hoare triple {19909#true} call #t~ret14 := finddup(~a~0.base, ~a~0.offset, ~n~0, ~#i~2.base, ~#i~2.offset, ~#j~2.base, ~#j~2.offset); {19909#true} is VALID [2022-04-27 11:55:58,336 INFO L290 TraceCheckUtils]: 37: Hoare triple {19909#true} call ~#i~2.base, ~#i~2.offset := #Ultimate.allocOnStack(4);call ~#j~2.base, ~#j~2.offset := #Ultimate.allocOnStack(4); {19909#true} is VALID [2022-04-27 11:55:58,336 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19909#true} {19909#true} #102#return; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {19909#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~x~0 := #t~nondet7;havoc #t~nondet7;call write~int(~x~0, ~a.base, ~a.offset + 4 * ~i~0, 4);call write~int(~x~0, ~a.base, ~a.offset + 4 * ~j~0, 4); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {19909#true} {19909#true} #120#return; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L272 TraceCheckUtils]: 29: Hoare triple {19909#true} call assume_abort_if_not((if ~i~0 != ~j~0 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {19909#true} {19909#true} #118#return; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L272 TraceCheckUtils]: 24: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~j~0 && ~j~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19909#true} {19909#true} #116#return; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:58,337 INFO L272 TraceCheckUtils]: 19: Hoare triple {19909#true} call assume_abort_if_not((if 0 <= ~i~0 && ~i~0 < ~n then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {19909#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~i~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~j~0 := #t~nondet6;havoc #t~nondet6; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L272 TraceCheckUtils]: 17: Hoare triple {19909#true} call mkdup(~a~0.base, ~a~0.offset, ~n~0); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#true} ~a~0.base, ~a~0.offset := #t~malloc13.base, #t~malloc13.offset; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19909#true} {19909#true} #100#return; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {19909#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L272 TraceCheckUtils]: 12: Hoare triple {19909#true} call #Ultimate.meminit(#t~malloc13.base, #t~malloc13.offset, ~n~0, 4, 4 * ~n~0); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {19909#true} call #t~malloc13.base, #t~malloc13.offset := #Ultimate.allocOnHeap(4 * ~n~0); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19909#true} {19909#true} #98#return; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {19909#true} assume !(0 == ~cond); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {19909#true} ~cond := #in~cond; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L272 TraceCheckUtils]: 6: Hoare triple {19909#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 < 1073741824 then 1 else 0)); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {19909#true} assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~n~0 := #t~nondet12;havoc #t~nondet12; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {19909#true} call #t~ret27 := main(); {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19909#true} {19909#true} #122#return; {19909#true} is VALID [2022-04-27 11:55:58,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {19909#true} assume true; {19909#true} is VALID [2022-04-27 11:55:58,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {19909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19909#true} is VALID [2022-04-27 11:55:58,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {19909#true} call ULTIMATE.init(); {19909#true} is VALID [2022-04-27 11:55:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 51 proven. 89 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-04-27 11:55:58,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179670258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 11:55:58,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 11:55:58,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2022-04-27 11:55:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721784249] [2022-04-27 11:55:58,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 11:55:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2022-04-27 11:55:58,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:55:58,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:55:58,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:58,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 11:55:58,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:55:58,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 11:55:58,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:55:58,405 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:55:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:59,293 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2022-04-27 11:55:59,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 11:55:59,293 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 88 [2022-04-27 11:55:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:55:59,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:55:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-27 11:55:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:55:59,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 93 transitions. [2022-04-27 11:55:59,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 93 transitions. [2022-04-27 11:55:59,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:55:59,366 INFO L225 Difference]: With dead ends: 102 [2022-04-27 11:55:59,366 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:55:59,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 187 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2022-04-27 11:55:59,367 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 45 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:55:59,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 34 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 11:55:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:55:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:55:59,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:55:59,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:55:59,367 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:55:59,367 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:55:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:59,368 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:55:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:55:59,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:59,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:59,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:55:59,368 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:55:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:55:59,368 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:55:59,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:55:59,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:59,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:55:59,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:55:59,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:55:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:55:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:55:59,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-04-27 11:55:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:55:59,369 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:55:59,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-27 11:55:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:55:59,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:55:59,371 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:55:59,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-27 11:55:59,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:55:59,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:56:08,104 WARN L232 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 56 DAG size of output: 47 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 11:57:02,106 WARN L232 SmtUtils]: Spent 53.97s on a formula simplification. DAG size of input: 494 DAG size of output: 245 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 11:57:48,198 WARN L232 SmtUtils]: Spent 43.97s on a formula simplification. DAG size of input: 357 DAG size of output: 174 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-27 11:57:48,852 INFO L895 garLoopResultBuilder]: At program point finddupENTRY(lines 33 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point finddupEXIT(lines 33 46) no Hoare annotation was computed. [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-04-27 11:57:48,852 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 36 44) no Hoare annotation was computed. [2022-04-27 11:57:48,853 INFO L895 garLoopResultBuilder]: At program point L36-3(lines 36 44) the Hoare annotation is: (let ((.cse38 (select |#memory_int| finddup_~a.base)) (.cse27 ((as const (Array Int Int)) 0))) (let ((.cse44 (@diff .cse38 .cse27))) (let ((.cse45 (store .cse38 .cse44 0))) (let ((.cse43 (@diff .cse45 .cse27)) (.cse42 (* finddup_~i~1 4))) (let ((.cse26 (+ finddup_~i~1 3)) (.cse14 (select .cse38 (+ finddup_~a.offset .cse42))) (.cse15 (not (= .cse27 (store .cse45 .cse43 0))))) (let ((.cse1 (or (= .cse14 (select .cse38 (+ finddup_~a.offset .cse42 4))) (and (not (= (select .cse38 .cse43) (select .cse38 .cse44))) (not (= .cse27 .cse45))) .cse15)) (.cse2 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse40 (select |#memory_int| finddup_~a.base))) (let ((.cse39 (select .cse40 finddup_~a.offset)) (.cse41 (* v_finddup_~j~1_119 4))) (and (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse39 (select .cse40 (+ finddup_~a.offset .cse41))))))))) (.cse3 (= finddup_~i~1 1)) (.cse6 (not (= (select .cse38 finddup_~a.offset) (select .cse38 (+ finddup_~a.offset 4))))) (.cse10 (<= 3 finddup_~n)) (.cse23 (<= (+ finddup_~i~1 4) finddup_~n)) (.cse18 (not (let ((.cse37 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse37 (+ |finddup_#in~a.offset| 4)) (select .cse37 |finddup_#in~a.offset|))))) (.cse19 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse36 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse36 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse36 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n)))) (.cse21 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse35 (select |#memory_int| finddup_~a.base))) (= (select .cse35 (+ finddup_~a.offset 4)) (select .cse35 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse11 (<= finddup_~j~1 .cse26)) (.cse22 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse32 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse33 (* v_finddup_~j~1_119 4)) (.cse34 (select .cse32 |finddup_#in~a.offset|))) (and (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset|)) .cse34)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse32 (+ .cse33 |finddup_#in~a.offset| (- 4))) .cse34)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse7 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse9 (= |finddup_#in~a.base| finddup_~a.base)) (.cse0 (= |#memory_int| |old(#memory_int)|)) (.cse4 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse5 (= |finddup_#in~n| finddup_~n)) (.cse24 (<= finddup_~j~1 (+ finddup_~i~1 1))) (.cse8 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse12 (<= finddup_~n finddup_~j~1)) (.cse13 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse16 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (<= |finddup_#in~n| 1) .cse0) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (or (= .cse14 0) .cse15) .cse16) (and (let ((.cse20 (+ finddup_~i~1 2))) (let ((.cse17 (<= finddup_~j~1 .cse20))) (or (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse10 .cse17 .cse12) (and .cse0 .cse4 .cse5 .cse18 .cse19 (<= .cse20 finddup_~n) .cse17 .cse21 .cse12 .cse22)))) .cse7 .cse8 .cse9 .cse13 .cse16) (and .cse1 .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse24 .cse8 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse25 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse25 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse25 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse12 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse23 (<= 1 finddup_~i~1) .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse12 .cse22 .cse13 .cse16) (and .cse0 .cse4 .cse5 .cse18 .cse19 .cse7 .cse8 .cse9 .cse21 .cse11 .cse12 .cse22 .cse13 .cse16 (<= .cse26 finddup_~n)) (and .cse0 .cse4 .cse5 (= finddup_~i~1 0) .cse7 .cse8 .cse9 .cse13 .cse16) (let ((.cse30 (select |old(#memory_int)| |finddup_#in~a.base|))) (let ((.cse31 (@diff .cse30 .cse27))) (let ((.cse28 (store .cse30 .cse31 0))) (and (let ((.cse29 (@diff .cse28 .cse27))) (or (not (= .cse27 (store .cse28 .cse29 0))) (not (= (select .cse30 .cse29) (select .cse30 .cse31))))) .cse0 .cse4 .cse5 .cse24 .cse8 (not (= .cse28 .cse27)) .cse12 .cse13 .cse16))))))))))) [2022-04-27 11:57:48,853 INFO L899 garLoopResultBuilder]: For program point L36-4(lines 36 44) no Hoare annotation was computed. [2022-04-27 11:57:48,853 INFO L899 garLoopResultBuilder]: For program point finddupFINAL(lines 33 46) no Hoare annotation was computed. [2022-04-27 11:57:48,853 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 43) no Hoare annotation was computed. [2022-04-27 11:57:48,854 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 43) the Hoare annotation is: (let ((.cse1 (select |#memory_int| finddup_~a.base)) (.cse61 ((as const (Array Int Int)) 0))) (let ((.cse42 (@diff .cse1 .cse61))) (let ((.cse65 (store .cse1 .cse42 0)) (.cse63 (select |old(#memory_int)| |finddup_#in~a.base|)) (.cse39 (* finddup_~i~1 4))) (let ((.cse50 (+ finddup_~a.offset .cse39)) (.cse64 (@diff .cse63 .cse61)) (.cse41 (@diff .cse65 .cse61)) (.cse28 (+ finddup_~i~1 2))) (let ((.cse2 (* finddup_~j~1 4)) (.cse52 (= finddup_~i~1 0)) (.cse4 (or (< finddup_~i~1 finddup_~n) (<= |finddup_#in~n| 0))) (.cse5 (= |finddup_#in~_j.base| finddup_~_j.base)) (.cse7 (= |finddup_#in~n| finddup_~n)) (.cse8 (<= .cse28 finddup_~j~1)) (.cse9 (<= 1 finddup_~i~1)) (.cse12 (= finddup_~_j.offset |finddup_#in~_j.offset|)) (.cse3 (= |#memory_int| |old(#memory_int)|)) (.cse14 (= |finddup_#in~a.base| finddup_~a.base)) (.cse43 (not (= .cse61 (store .cse65 .cse41 0)))) (.cse60 (store .cse63 .cse64 0)) (.cse0 (select .cse1 .cse50)) (.cse40 (select .cse1 (+ finddup_~a.offset .cse39 4))) (.cse49 (+ finddup_~i~1 1))) (let ((.cse15 (<= finddup_~j~1 .cse28)) (.cse34 (<= .cse49 finddup_~j~1)) (.cse26 (= .cse0 .cse40)) (.cse25 (let ((.cse62 (@diff .cse60 .cse61))) (or (not (= .cse61 (store .cse60 .cse62 0))) (not (= (select .cse63 .cse62) (select .cse63 .cse64)))))) (.cse33 (<= finddup_~j~1 .cse49)) (.cse27 (not (= .cse60 .cse61))) (.cse29 (<= finddup_~n finddup_~j~1)) (.cse35 (<= 1 finddup_~j~1)) (.cse6 (and .cse3 .cse14 .cse43)) (.cse10 (not (let ((.cse59 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse59 (+ |finddup_#in~a.offset| 4)) (select .cse59 |finddup_#in~a.offset|))))) (.cse13 (exists ((v_finddup_~j~1_121 Int)) (and (not (let ((.cse58 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse58 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse58 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|))))) (< v_finddup_~j~1_121 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_121 1))))) (.cse37 (exists ((finddup_~j~1 Int)) (and (<= 2 finddup_~j~1) (not (let ((.cse57 (select |#memory_int| finddup_~a.base))) (= (select .cse57 (+ finddup_~a.offset 4)) (select .cse57 (+ finddup_~a.offset (* finddup_~j~1 4)))))) (< finddup_~j~1 finddup_~n)))) (.cse48 (let ((.cse56 (<= (+ finddup_~i~1 3) finddup_~n))) (or (and .cse3 .cse4 .cse5 .cse7 .cse52 .cse8 .cse12 .cse56) (and .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12 .cse56)))) (.cse16 (exists ((v_finddup_~j~1_119 Int)) (let ((.cse53 (select |#memory_int| |finddup_#in~a.base|))) (let ((.cse54 (* v_finddup_~j~1_119 4)) (.cse55 (select .cse53 |finddup_#in~a.offset|))) (and (not (= (select .cse53 (+ .cse54 |finddup_#in~a.offset|)) .cse55)) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (not (= (select .cse53 (+ .cse54 |finddup_#in~a.offset| (- 4))) .cse55)) (< v_finddup_~j~1_119 finddup_~n)))))) (.cse47 (not (= (select .cse1 (+ finddup_~a.offset .cse2 (- 4))) .cse0))) (.cse11 (= finddup_~a.offset |finddup_#in~a.offset|)) (.cse17 (= |finddup_#in~_i.base| finddup_~_i.base)) (.cse18 (= |finddup_#in~_i.offset| finddup_~_i.offset))) (or (and (= .cse0 (select .cse1 (+ finddup_~a.offset .cse2))) .cse3 .cse4 .cse5 (or (= (select .cse1 (+ finddup_~a.offset .cse2 4)) .cse0) .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and (let ((.cse24 (<= .cse28 finddup_~n))) (or (and (exists ((finddup_~i~1 Int)) (let ((.cse22 (select |#memory_int| |finddup_#in~a.base|)) (.cse23 (* finddup_~i~1 4))) (let ((.cse20 (select .cse22 (+ |finddup_#in~a.offset| (- 4) .cse23))) (.cse21 (select .cse22 (+ |finddup_#in~a.offset| .cse23))) (.cse19 (select .cse22 (+ |finddup_#in~a.offset| .cse23 4)))) (and (<= |finddup_#in~n| (+ finddup_~i~1 2)) (not (= .cse19 .cse20)) (<= finddup_~i~1 1) (not (= .cse21 .cse20)) (not (= .cse21 .cse19)))))) .cse5 .cse7 .cse9 .cse12 .cse24 .cse15 .cse17 .cse18) (and .cse25 .cse5 (or .cse26 .cse14) .cse7 .cse9 .cse12 .cse24 .cse27 .cse15 .cse17 .cse18))) .cse3 .cse29) (and (exists ((v_finddup_~j~1_119 Int)) (let ((.cse31 (select |#memory_int| finddup_~a.base))) (let ((.cse30 (select .cse31 finddup_~a.offset)) (.cse32 (* v_finddup_~j~1_119 4))) (and (not (= .cse30 (select .cse31 (+ finddup_~a.offset .cse32 (- 4))))) (<= finddup_~n (+ v_finddup_~j~1_119 1)) (< v_finddup_~j~1_119 finddup_~n) (not (= .cse30 (select .cse31 (+ finddup_~a.offset .cse32)))))))) (= finddup_~i~1 1) .cse3 .cse4 .cse5 .cse7 (not (= (select .cse1 finddup_~a.offset) (select .cse1 (+ finddup_~a.offset 4)))) .cse33 .cse11 .cse12 .cse14 .cse34 .cse17 .cse18) (and .cse3 .cse4 .cse5 .cse7 .cse35 .cse10 .cse33 (exists ((v_finddup_~j~1_121 Int)) (and (<= finddup_~n (+ v_finddup_~j~1_121 1)) (not (let ((.cse36 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse36 (+ (* v_finddup_~j~1_121 4) |finddup_#in~a.offset|)) (select .cse36 (+ |finddup_#in~a.offset| (- 4) (* finddup_~i~1 4)))))) (< v_finddup_~j~1_121 finddup_~n))) .cse11 .cse12 .cse14 .cse34 .cse37 .cse16 .cse17 .cse18) (and (<= |finddup_#in~n| 1) .cse3 .cse4) (and .cse3 .cse4 .cse5 .cse7 .cse33 .cse12 (exists ((finddup_~i~1 Int) (v_finddup_~j~1_25 Int)) (and (<= v_finddup_~j~1_25 (+ finddup_~i~1 1)) (<= finddup_~i~1 0) (not (let ((.cse38 (select |#memory_int| |finddup_#in~a.base|))) (= (select .cse38 (+ |finddup_#in~a.offset| (* finddup_~i~1 4))) (select .cse38 (+ (* v_finddup_~j~1_25 4) |finddup_#in~a.offset|))))) (<= |finddup_#in~n| (+ v_finddup_~j~1_25 1)))) .cse29 .cse17 .cse18) (and (or (= (select .cse1 (+ finddup_~a.offset .cse39 8)) .cse40) (not (= (select .cse1 .cse41) .cse0)) (not (= .cse0 (select .cse1 .cse42))) .cse43) (= .cse39 0) (exists ((v_finddup_~j~1_119 Int)) (let ((.cse44 (select |#memory_int| finddup_~a.base))) (let ((.cse45 (* v_finddup_~j~1_119 4)) (.cse46 (select .cse44 (+ finddup_~a.offset (* finddup_~i~1 4))))) (and (not (= (select .cse44 (+ finddup_~a.offset .cse45)) .cse46)) (< v_finddup_~j~1_119 finddup_~n) (<= finddup_~j~1 (+ v_finddup_~j~1_119 1)) (not (= (select .cse44 (+ finddup_~a.offset .cse45 (- 4))) .cse46)))))) (not .cse26) .cse47 .cse11 .cse14 .cse48 .cse17 .cse18) (and .cse25 .cse3 .cse4 .cse5 .cse7 .cse33 .cse12 .cse27 .cse29 .cse17 .cse18) (and .cse3 .cse4 .cse5 .cse7 .cse35 .cse11 .cse12 (= finddup_~j~1 .cse49) .cse14 (<= finddup_~j~1 1) .cse17 .cse18) (and (or .cse6 (and (not (= .cse0 0)) .cse14 (let ((.cse51 (* (- 1) finddup_~a.offset))) (or (and (not (= .cse50 .cse42)) (<= (+ 3 (div (+ .cse51 .cse42) 4)) finddup_~j~1)) (and (<= (+ 3 (div (+ .cse41 .cse51) 4)) finddup_~j~1) (not (= .cse50 .cse41))))))) .cse10 .cse11 .cse13 .cse37 .cse48 .cse16 .cse17 .cse18) (and .cse3 .cse4 .cse5 .cse7 .cse52 .cse47 (= finddup_~j~1 .cse28) .cse11 .cse12 .cse14 .cse17 .cse18)))))))) [2022-04-27 11:57:48,854 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:57:48,854 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:57:48,854 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-27 11:57:48,855 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-27 11:57:48,855 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse6 (select |#memory_int| main_~a~0.base)) (.cse9 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|)) (.cse12 (+ main_~a~0.base 1))) (let ((.cse0 (= main_~a~0.offset 0)) (.cse2 (<= 2 main_~n~0)) (.cse3 (not (= |main_#t~mem22| |main_#t~mem21|))) (.cse4 (= |main_~#j~2.offset| 0)) (.cse7 (= |main_~#i~2.offset| 0)) (.cse10 (< .cse12 |main_~#j~2.base|)) (.cse5 (select .cse6 (* .cse9 4))) (.cse11 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse8 (not (= .cse9 .cse1)))) (or (and .cse0 (= 0 .cse1) .cse2 .cse3 .cse4 (= .cse5 (select .cse6 0)) .cse7 .cse8) (and .cse0 (= 1 .cse1) .cse2 .cse3 .cse4 (= .cse9 2) .cse7 .cse10 .cse11 .cse8 (= (select .cse6 (+ main_~a~0.offset 4)) (select .cse6 (+ main_~a~0.offset 8)))) (and (<= .cse12 |#StackHeapBarrier|) .cse0 .cse2 .cse3 .cse4 .cse7 .cse10 (= (select .cse6 (* 4 .cse1)) .cse5) .cse11 .cse8 (= (select |#valid| main_~a~0.base) 1))))) [2022-04-27 11:57:48,855 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-04-27 11:57:48,855 INFO L899 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-04-27 11:57:48,855 INFO L895 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: (let ((.cse7 (select |#memory_int| main_~a~0.base)) (.cse13 (+ main_~a~0.base 1)) (.cse4 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse10 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse0 (<= (+ .cse10 1) main_~n~0)) (.cse1 (< (+ 1 .cse4) main_~n~0)) (.cse2 (<= 1 .cse10)) (.cse3 (= main_~a~0.offset 0)) (.cse5 (= |main_~#j~2.offset| 0)) (.cse8 (= |main_~#i~2.offset| 0)) (.cse11 (< .cse13 |main_~#j~2.base|)) (.cse6 (select .cse7 (* .cse10 4))) (.cse12 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse9 (not (= .cse10 .cse4)))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 .cse4) .cse5 (= .cse6 (select .cse7 0)) .cse8 .cse9 |main_#t~short17|) (and .cse0 .cse1 .cse2 .cse3 (= 1 .cse4) .cse5 (= .cse10 2) .cse8 .cse11 .cse12 .cse9 (= (select .cse7 (+ main_~a~0.offset 4)) (select .cse7 (+ main_~a~0.offset 8))) |main_#t~short17|) (and (<= .cse13 |#StackHeapBarrier|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse8 .cse11 (= (select .cse7 (* 4 .cse4)) .cse6) .cse12 .cse9 (= (select |#valid| main_~a~0.base) 1) |main_#t~short17|)))) [2022-04-27 11:57:48,855 INFO L899 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2022-04-27 11:57:48,855 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 48 66) no Hoare annotation was computed. [2022-04-27 11:57:48,855 INFO L895 garLoopResultBuilder]: At program point L54(line 54) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (<= (+ main_~a~0.base 1) |#StackHeapBarrier|) (= |main_#t~malloc13.offset| 0) (= main_~a~0.offset 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc13.base|)) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|) (= (select |#valid| main_~a~0.base) 1))) [2022-04-27 11:57:48,856 INFO L899 garLoopResultBuilder]: For program point L54-1(line 54) no Hoare annotation was computed. [2022-04-27 11:57:48,856 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= |main_#t~malloc13.offset| 0) (= |#memory_int| |old(#memory_int)|) (= (select |#valid| |main_#t~malloc13.base|) 1) (<= (+ |main_#t~malloc13.base| 1) |#StackHeapBarrier|)) [2022-04-27 11:57:48,856 INFO L899 garLoopResultBuilder]: For program point L52-1(line 52) no Hoare annotation was computed. [2022-04-27 11:57:48,856 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 48 66) no Hoare annotation was computed. [2022-04-27 11:57:48,856 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= 2 main_~n~0) (= |main_~#j~2.offset| 0) (= |main_#t~mem26| |main_#t~mem25|) (= |main_~#i~2.offset| 0) (not (= |main_~#i~2.base| |main_~#j~2.base|))) [2022-04-27 11:57:48,856 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2022-04-27 11:57:48,856 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 48 66) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:57:48,856 INFO L899 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-04-27 11:57:48,856 INFO L895 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (let ((.cse9 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|))) (let ((.cse7 (+ main_~a~0.base 1)) (.cse2 (= 0 .cse9)) (.cse5 (select |#memory_int| main_~a~0.base)) (.cse11 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse4 (select .cse5 (* .cse11 4))) (.cse0 (= main_~a~0.offset 0)) (.cse1 (let ((.cse12 (<= (+ .cse11 1) main_~n~0)) (.cse13 (<= 1 .cse11)) (.cse14 (= main_~r~0 1)) (.cse15 (= |main_~#i~2.offset| 0))) (or (and .cse12 .cse13 .cse2 .cse14 .cse15) (and (<= 1 .cse9) .cse12 (< (+ 1 .cse9) main_~n~0) .cse13 .cse14 .cse15)))) (.cse3 (= |main_~#j~2.offset| 0)) (.cse8 (< .cse7 |main_~#j~2.base|)) (.cse10 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse6 (not (= .cse11 .cse9)))) (or (and .cse0 .cse1 .cse2 .cse3 (= .cse4 (select .cse5 0)) .cse6) (and (<= .cse7 |#StackHeapBarrier|) .cse0 .cse1 .cse3 .cse8 (= (select .cse5 (* 4 .cse9)) .cse4) .cse10 .cse6 (= (select |#valid| main_~a~0.base) 1)) (and .cse0 (= 1 .cse9) .cse1 .cse3 (= .cse11 2) .cse8 .cse10 .cse6 (= (select .cse5 (+ main_~a~0.offset 4)) (select .cse5 (+ main_~a~0.offset 8)))))))) [2022-04-27 11:57:48,856 INFO L895 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| |main_~#i~2.base|) |main_~#i~2.offset|)) (.cse9 (+ main_~a~0.base 1)) (.cse6 (select |#memory_int| main_~a~0.base)) (.cse12 (select (select |#memory_int| |main_~#j~2.base|) |main_~#j~2.offset|))) (let ((.cse5 (select .cse6 (* .cse12 4))) (.cse0 (<= (+ .cse12 1) main_~n~0)) (.cse1 (= main_~a~0.offset 0)) (.cse3 (<= 2 main_~n~0)) (.cse4 (= |main_~#j~2.offset| 0)) (.cse7 (= |main_~#i~2.offset| 0)) (.cse10 (< .cse9 |main_~#j~2.base|)) (.cse11 (not (= |main_~#i~2.base| main_~a~0.base))) (.cse8 (not (= .cse12 .cse2)))) (or (and .cse0 .cse1 (= 0 .cse2) .cse3 .cse4 (= .cse5 (select .cse6 0)) .cse7 .cse8 |main_#t~short20|) (and (<= .cse9 |#StackHeapBarrier|) .cse0 .cse1 .cse3 .cse4 .cse7 .cse10 (= (select .cse6 (* 4 .cse2)) .cse5) .cse11 .cse8 (= (select |#valid| main_~a~0.base) 1) |main_#t~short20|) (and .cse0 .cse1 (= 1 .cse2) .cse3 .cse4 (= .cse12 2) .cse7 .cse10 .cse11 .cse8 (= (select .cse6 (+ main_~a~0.offset 4)) (select .cse6 (+ main_~a~0.offset 8))) |main_#t~short20|)))) [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (+ main_~a~0.base 1))) (and (<= .cse0 |#StackHeapBarrier|) (= main_~a~0.offset 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (= |main_~#j~2.offset| 0) (exists ((mkdup_~j~0 Int) (mkdup_~x~0 Int) (mkdup_~i~0 Int)) (and (< mkdup_~j~0 main_~n~0) (< mkdup_~i~0 main_~n~0) (<= 0 mkdup_~j~0) (= (select |#memory_int| main_~a~0.base) (store (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* mkdup_~i~0 4)) mkdup_~x~0) (+ main_~a~0.offset (* mkdup_~j~0 4)) mkdup_~x~0)) (not (= mkdup_~j~0 mkdup_~i~0)) (<= 0 mkdup_~i~0))) (< .cse0 |main_~#i~2.base|) (= |main_~#i~2.offset| 0) (< .cse0 |main_~#j~2.base|) (= (select |#valid| main_~a~0.base) 1) (not (= |main_~#i~2.base| |main_~#j~2.base|)))) [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point L57-1(line 57) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L895 garLoopResultBuilder]: At program point mkdupENTRY(lines 19 31) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point mkdupFINAL(lines 19 31) no Hoare annotation was computed. [2022-04-27 11:57:48,857 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (<= 0 mkdup_~j~0) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~j~0 |mkdup_#in~n|) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-04-27 11:57:48,858 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|))) [2022-04-27 11:57:48,858 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (and (= |mkdup_#in~n| mkdup_~n) (= |#memory_int| |old(#memory_int)|) (= |mkdup_#in~a.offset| mkdup_~a.offset) (= mkdup_~a.base |mkdup_#in~a.base|) (<= 0 mkdup_~i~0) (< mkdup_~i~0 |mkdup_#in~n|))) [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point mkdupEXIT(lines 19 31) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:57:48,858 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point L10-1(line 10) no Hoare annotation was computed. [2022-04-27 11:57:48,858 INFO L899 garLoopResultBuilder]: For program point L10-3(lines 9 11) no Hoare annotation was computed. [2022-04-27 11:57:48,859 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-04-27 11:57:48,859 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (forall ((|v_main_#t~malloc13.base_BEFORE_CALL_2| Int)) (or (not (= (select |#valid| |v_main_#t~malloc13.base_BEFORE_CALL_2|) 1)) (not (<= (+ |v_main_#t~malloc13.base_BEFORE_CALL_2| 1) |#StackHeapBarrier|)))) (= |#memory_int| |old(#memory_int)|)) [2022-04-27 11:57:48,859 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,859 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:57:48,861 INFO L356 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:57:48,863 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:57:48,865 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:57:48,865 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:57:48,876 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2022-04-27 11:57:48,877 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2022-04-27 11:57:48,918 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L36-4 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:57:48,919 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L51-1 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L10-1 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L10-3 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: finddupFINAL has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-27 11:57:48,920 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-27 11:57:48,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:48,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:48,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:48,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:48,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: finddupEXIT has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-04-27 11:57:48,922 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: mkdupFINAL has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 11:57:48,923 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: mkdupEXIT has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L61-3 has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:57:48,924 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-04-27 11:57:48,926 INFO L163 areAnnotationChecker]: CFG has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:57:48,929 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateSelect(Term2Expression.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:161) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:449) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-27 11:57:48,933 INFO L158 Benchmark]: Toolchain (without parser) took 760832.95ms. Allocated memory was 209.7MB in the beginning and 362.8MB in the end (delta: 153.1MB). Free memory was 178.2MB in the beginning and 163.6MB in the end (delta: 14.7MB). Peak memory consumption was 229.7MB. Max. memory is 8.0GB. [2022-04-27 11:57:48,933 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:57:48,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.43ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 178.0MB in the beginning and 219.4MB in the end (delta: -41.4MB). Peak memory consumption was 4.6MB. Max. memory is 8.0GB. [2022-04-27 11:57:48,933 INFO L158 Benchmark]: Boogie Preprocessor took 34.93ms. Allocated memory is still 251.7MB. Free memory was 219.4MB in the beginning and 217.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:57:48,933 INFO L158 Benchmark]: RCFGBuilder took 417.42ms. Allocated memory is still 251.7MB. Free memory was 217.4MB in the beginning and 200.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-27 11:57:48,933 INFO L158 Benchmark]: TraceAbstraction took 760150.82ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 199.6MB in the beginning and 163.6MB in the end (delta: 36.0MB). Peak memory consumption was 210.6MB. Max. memory is 8.0GB. [2022-04-27 11:57:48,934 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 166.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.43ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 178.0MB in the beginning and 219.4MB in the end (delta: -41.4MB). Peak memory consumption was 4.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.93ms. Allocated memory is still 251.7MB. Free memory was 219.4MB in the beginning and 217.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 417.42ms. Allocated memory is still 251.7MB. Free memory was 217.4MB in the beginning and 200.1MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 760150.82ms. Allocated memory was 251.7MB in the beginning and 362.8MB in the end (delta: 111.1MB). Free memory was 199.6MB in the beginning and 163.6MB in the end (delta: 36.0MB). Peak memory consumption was 210.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 760.0s, OverallIterations: 23, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 351.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 109.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2243 SdHoareTripleChecker+Valid, 18.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2128 mSDsluCounter, 3283 SdHoareTripleChecker+Invalid, 18.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2087 IncrementalHoareTripleChecker+Unchecked, 2202 mSDsCounter, 1577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15288 IncrementalHoareTripleChecker+Invalid, 18952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1577 mSolverCounterUnsat, 1081 mSDtfsCounter, 15288 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3115 GetRequests, 2177 SyntacticMatches, 50 SemanticMatches, 888 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16094 ImplicationChecksByTransitivity, 425.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=16, InterpolantAutomatonStates: 516, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 224 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 152 PreInvPairs, 223 NumberOfFragments, 4226 HoareAnnotationTreeSize, 152 FomulaSimplifications, 3166 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 23 FomulaSimplificationsInter, 96110 FormulaSimplificationTreeSizeReductionInter, 106.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 261.5s InterpolantComputationTime, 2726 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3351 ConstructedInterpolants, 171 QuantifiedInterpolants, 37935 SizeOfPredicates, 212 NumberOfNonLiveVariables, 4622 ConjunctsInSsa, 737 ConjunctsInUnsatCore, 50 InterpolantComputations, 9 PerfectInterpolantSequences, 2040/2875 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-27 11:57:49,155 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-27 11:57:49,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...