/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:03:58,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:03:58,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:03:58,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:03:58,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:03:58,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:03:58,915 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:03:58,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:03:58,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:03:58,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:03:58,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:03:58,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:03:58,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:03:58,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:03:58,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:03:58,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:03:58,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:03:58,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:03:58,927 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:03:58,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:03:58,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:03:58,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:03:58,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:03:58,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:03:58,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:03:58,936 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:03:58,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:03:58,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:03:58,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:03:58,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:03:58,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:03:58,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:03:58,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:03:58,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:03:58,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:03:58,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:03:58,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:03:58,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:03:58,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:03:58,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:03:58,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:03:58,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:03:58,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:03:58,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:03:58,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:03:58,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:03:58,967 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:03:58,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:03:58,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:03:58,968 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:03:58,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:03:58,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:03:58,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:03:58,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:03:58,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:03:58,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:03:58,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:03:58,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:03:58,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:03:58,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:03:58,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:03:58,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:03:58,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:03:58,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:03:58,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:03:58,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:03:58,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:03:58,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:03:58,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:03:58,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:03:58,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:03:58,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:03:58,973 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-15 00:03:59,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:03:59,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:03:59,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:03:59,248 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:03:59,249 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:03:59,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2022-04-15 00:03:59,308 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea23840bb/19158f13fd4747dfbae4d68757f9757e/FLAGcab3eb2c8 [2022-04-15 00:03:59,698 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:03:59,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-04-15 00:03:59,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea23840bb/19158f13fd4747dfbae4d68757f9757e/FLAGcab3eb2c8 [2022-04-15 00:04:00,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea23840bb/19158f13fd4747dfbae4d68757f9757e [2022-04-15 00:04:00,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:04:00,113 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:04:00,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:00,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:04:00,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:04:00,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a2d0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00, skipping insertion in model container [2022-04-15 00:04:00,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:04:00,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:04:00,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-04-15 00:04:00,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:00,396 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:04:00,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[383,396] [2022-04-15 00:04:00,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:04:00,426 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:04:00,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00 WrapperNode [2022-04-15 00:04:00,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:04:00,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:04:00,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:04:00,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:04:00,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,460 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:04:00,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:04:00,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:04:00,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:04:00,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:04:00,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:00,494 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-15 00:04:00,496 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-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-15 00:04:00,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:04:00,526 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-15 00:04:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:04:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:04:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:04:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:04:00,526 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-15 00:04:00,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:04:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:04:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:04:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:04:00,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:04:00,609 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:04:00,611 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:04:00,811 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:04:00,817 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:04:00,817 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:04:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:00 BoogieIcfgContainer [2022-04-15 00:04:00,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:04:00,820 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:04:00,820 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:04:00,822 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:04:00,824 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:00" (1/1) ... [2022-04-15 00:04:00,826 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:04:00,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:00 BasicIcfg [2022-04-15 00:04:00,849 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:04:00,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:04:00,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:04:00,854 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:04:00,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:04:00" (1/4) ... [2022-04-15 00:04:00,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159c2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:00, skipping insertion in model container [2022-04-15 00:04:00,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:04:00" (2/4) ... [2022-04-15 00:04:00,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159c2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:04:00, skipping insertion in model container [2022-04-15 00:04:00,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:04:00" (3/4) ... [2022-04-15 00:04:00,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@159c2cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:04:00, skipping insertion in model container [2022-04-15 00:04:00,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:04:00" (4/4) ... [2022-04-15 00:04:00,857 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.cqvasr [2022-04-15 00:04:00,862 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:04:00,862 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:04:00,903 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:04:00,909 INFO L340 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=FINITE_AUTOMATA, 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 [2022-04-15 00:04:00,909 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:04:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 00:04:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 00:04:00,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:00,929 INFO L499 BasicCegarLoop]: trace histogram [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-15 00:04:00,929 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1395824931, now seen corresponding path program 1 times [2022-04-15 00:04:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343306374] [2022-04-15 00:04:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:00,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {37#true} is VALID [2022-04-15 00:04:01,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:04:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {37#true} is VALID [2022-04-15 00:04:01,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {37#true} is VALID [2022-04-15 00:04:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:04:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {37#true} is VALID [2022-04-15 00:04:01,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L19-2-->L17-5: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [96] L17-5-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_9 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_9} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_9} AuxVars[] AssignedVars[linear_search_#res] {38#false} is VALID [2022-04-15 00:04:01,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,278 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {38#false} is VALID [2022-04-15 00:04:01,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:01,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {37#true} is VALID [2022-04-15 00:04:01,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {37#true} is VALID [2022-04-15 00:04:01,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {37#true} is VALID [2022-04-15 00:04:01,287 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {51#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:04:01,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {37#true} is VALID [2022-04-15 00:04:01,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-15 00:04:01,289 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {37#true} is VALID [2022-04-15 00:04:01,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {37#true} is VALID [2022-04-15 00:04:01,290 INFO L272 TraceCheckUtils]: 12: Hoare triple {37#true} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {37#true} is VALID [2022-04-15 00:04:01,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {37#true} is VALID [2022-04-15 00:04:01,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [92] L19-2-->L17-5: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [96] L17-5-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_9 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_9} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_9} AuxVars[] AssignedVars[linear_search_#res] {38#false} is VALID [2022-04-15 00:04:01,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,293 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {38#false} is VALID [2022-04-15 00:04:01,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,295 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {38#false} is VALID [2022-04-15 00:04:01,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-15 00:04:01,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-15 00:04:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:01,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:01,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343306374] [2022-04-15 00:04:01,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343306374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:01,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:01,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 00:04:01,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884132565] [2022-04-15 00:04:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:01,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 00:04:01,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:01,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:01,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:01,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 00:04:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:01,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 00:04:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 00:04:01,384 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:01,605 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 00:04:01,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 00:04:01,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-15 00:04:01,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 00:04:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-04-15 00:04:01,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-04-15 00:04:01,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:01,707 INFO L225 Difference]: With dead ends: 52 [2022-04-15 00:04:01,708 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 00:04:01,711 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-15 00:04:01,714 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:01,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:04:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 00:04:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 00:04:01,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:01,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:01,743 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:01,744 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:01,747 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 00:04:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:04:01,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:01,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:01,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 00:04:01,749 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 00:04:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:01,751 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-15 00:04:01,752 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:04:01,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:01,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:01,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:01,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-15 00:04:01,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-15 00:04:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:01,757 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-15 00:04:01,757 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-15 00:04:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 00:04:01,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:01,758 INFO L499 BasicCegarLoop]: trace histogram [1, 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-15 00:04:01,758 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:04:01,759 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1369163817, now seen corresponding path program 1 times [2022-04-15 00:04:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:01,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870193578] [2022-04-15 00:04:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {214#true} is VALID [2022-04-15 00:04:01,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:04:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {233#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {214#true} is VALID [2022-04-15 00:04:01,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {214#true} {214#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {214#true} is VALID [2022-04-15 00:04:01,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:04:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:01,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {214#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {214#true} is VALID [2022-04-15 00:04:01,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {214#true} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {214#true} is VALID [2022-04-15 00:04:01,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {214#true} is VALID [2022-04-15 00:04:01,954 INFO L290 TraceCheckUtils]: 3: Hoare triple {214#true} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {214#true} is VALID [2022-04-15 00:04:01,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {214#true} [96] L17-5-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_9 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_9} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_9} AuxVars[] AssignedVars[linear_search_#res] {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 00:04:01,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 00:04:01,958 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {214#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {229#(= |main_#t~ret9| 1)} is VALID [2022-04-15 00:04:01,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {214#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:01,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {214#true} is VALID [2022-04-15 00:04:01,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {214#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {214#true} {214#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {214#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {214#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {214#true} is VALID [2022-04-15 00:04:01,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {214#true} is VALID [2022-04-15 00:04:01,964 INFO L272 TraceCheckUtils]: 7: Hoare triple {214#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {233#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:04:01,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {233#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {214#true} is VALID [2022-04-15 00:04:01,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {214#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {214#true} is VALID [2022-04-15 00:04:01,965 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {214#true} {214#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {214#true} is VALID [2022-04-15 00:04:01,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {214#true} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {214#true} is VALID [2022-04-15 00:04:01,967 INFO L272 TraceCheckUtils]: 12: Hoare triple {214#true} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {214#true} is VALID [2022-04-15 00:04:01,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {214#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {214#true} is VALID [2022-04-15 00:04:01,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {214#true} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {214#true} is VALID [2022-04-15 00:04:01,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {214#true} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {214#true} is VALID [2022-04-15 00:04:01,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {214#true} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {214#true} is VALID [2022-04-15 00:04:01,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {214#true} [96] L17-5-->linear_searchFINAL: Formula: (and (< (mod v_linear_search_~j~0_9 4294967296) (mod v_~SIZE~0_1 4294967296)) (= |v_linear_search_#res_1| 1)) InVars {~SIZE~0=v_~SIZE~0_1, linear_search_~j~0=v_linear_search_~j~0_9} OutVars{~SIZE~0=v_~SIZE~0_1, linear_search_#res=|v_linear_search_#res_1|, linear_search_~j~0=v_linear_search_~j~0_9} AuxVars[] AssignedVars[linear_search_#res] {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 00:04:01,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-15 00:04:01,972 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {234#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {214#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {229#(= |main_#t~ret9| 1)} is VALID [2022-04-15 00:04:01,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {229#(= |main_#t~ret9| 1)} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {229#(= |main_#t~ret9| 1)} is VALID [2022-04-15 00:04:01,973 INFO L272 TraceCheckUtils]: 21: Hoare triple {229#(= |main_#t~ret9| 1)} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {230#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-15 00:04:01,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {230#(= |__VERIFIER_assert_#in~cond| 1)} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {231#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-15 00:04:01,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#(= __VERIFIER_assert_~cond 1)} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-15 00:04:01,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {215#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#false} is VALID [2022-04-15 00:04:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:01,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870193578] [2022-04-15 00:04:01,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870193578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:01,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:01,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:04:01,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447423109] [2022-04-15 00:04:01,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:01,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 00:04:01,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:01,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:02,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:02,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:04:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:02,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:04:02,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:04:02,021 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:02,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:02,428 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 00:04:02,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:04:02,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-15 00:04:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 00:04:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 00:04:02,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 00:04:02,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:02,477 INFO L225 Difference]: With dead ends: 35 [2022-04-15 00:04:02,477 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 00:04:02,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:04:02,479 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:02,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:04:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 00:04:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 00:04:02,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:02,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:02,484 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:02,484 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:02,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:02,486 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:04:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:04:02,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:02,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:02,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 00:04:02,487 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 00:04:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:02,489 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 00:04:02,489 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:04:02,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:02,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:02,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:02,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:02,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 00:04:02,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-15 00:04:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:02,492 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 00:04:02,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 00:04:02,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 00:04:02,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:02,493 INFO L499 BasicCegarLoop]: trace histogram [1, 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-15 00:04:02,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:04:02,494 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1182993144, now seen corresponding path program 1 times [2022-04-15 00:04:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:02,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962537738] [2022-04-15 00:04:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:02,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {386#true} is VALID [2022-04-15 00:04:02,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {386#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:04:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:02,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {386#true} is VALID [2022-04-15 00:04:02,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {386#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {386#true} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:04:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:04:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:02,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {386#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 00:04:02,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 00:04:02,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 00:04:02,719 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {387#false} is VALID [2022-04-15 00:04:02,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {386#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:02,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {402#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {386#true} is VALID [2022-04-15 00:04:02,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {386#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {386#true} {386#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {386#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {386#true} is VALID [2022-04-15 00:04:02,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:04:02,724 INFO L272 TraceCheckUtils]: 7: Hoare triple {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {403#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:04:02,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {386#true} is VALID [2022-04-15 00:04:02,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {386#true} is VALID [2022-04-15 00:04:02,726 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {386#true} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:04:02,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:04:02,726 INFO L272 TraceCheckUtils]: 12: Hoare triple {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {386#true} is VALID [2022-04-15 00:04:02,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-15 00:04:02,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {405#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:02,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {404#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 00:04:02,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-15 00:04:02,732 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {406#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {391#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {387#false} is VALID [2022-04-15 00:04:02,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {387#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {387#false} is VALID [2022-04-15 00:04:02,733 INFO L272 TraceCheckUtils]: 21: Hoare triple {387#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {387#false} is VALID [2022-04-15 00:04:02,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {387#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {387#false} is VALID [2022-04-15 00:04:02,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {387#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {387#false} is VALID [2022-04-15 00:04:02,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {387#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {387#false} is VALID [2022-04-15 00:04:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:02,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962537738] [2022-04-15 00:04:02,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962537738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:02,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:02,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:04:02,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662930728] [2022-04-15 00:04:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 00:04:02,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:02,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:04:02,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:02,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:04:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:04:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:04:02,769 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:04:07,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 00:04:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:07,847 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 00:04:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 00:04:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 00:04:07,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:04:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 00:04:07,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:04:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-15 00:04:07,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-15 00:04:07,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:07,913 INFO L225 Difference]: With dead ends: 40 [2022-04-15 00:04:07,913 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 00:04:07,913 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:04:07,914 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:07,915 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 00:04:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 00:04:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-15 00:04:07,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:07,928 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:07,928 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:07,929 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:07,931 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:04:07,931 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 00:04:07,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:07,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:07,931 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 00:04:07,932 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-15 00:04:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:07,933 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 00:04:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-15 00:04:07,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:07,934 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:07,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:07,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-15 00:04:07,936 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-04-15 00:04:07,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:07,936 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-15 00:04:07,936 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:04:07,936 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-15 00:04:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:04:07,937 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:07,937 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:07,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:04:07,938 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:07,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -503218689, now seen corresponding path program 1 times [2022-04-15 00:04:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:07,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9540023] [2022-04-15 00:04:07,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:07,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {603#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {584#true} is VALID [2022-04-15 00:04:07,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:07,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:07,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:04:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:08,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {584#true} is VALID [2022-04-15 00:04:08,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:08,005 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {584#true} is VALID [2022-04-15 00:04:08,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:04:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:08,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:08,082 INFO L290 TraceCheckUtils]: 4: Hoare triple {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [108] L19-->L19-2: Formula: (and (= (- 1) v_linear_search_~j~0_4) (= (mod v_linear_search_~j~0_5 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_5} OutVars{linear_search_~j~0=v_linear_search_~j~0_4} AuxVars[] AssignedVars[linear_search_~j~0] {585#false} is VALID [2022-04-15 00:04:08,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#false} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {585#false} is VALID [2022-04-15 00:04:08,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {585#false} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {585#false} is VALID [2022-04-15 00:04:08,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {585#false} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {585#false} is VALID [2022-04-15 00:04:08,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {585#false} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {585#false} is VALID [2022-04-15 00:04:08,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {585#false} is VALID [2022-04-15 00:04:08,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#false} {584#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {585#false} is VALID [2022-04-15 00:04:08,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {584#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {603#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:08,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {603#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {584#true} is VALID [2022-04-15 00:04:08,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {584#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:08,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {584#true} {584#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:08,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {584#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:08,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {584#true} is VALID [2022-04-15 00:04:08,086 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {584#true} is VALID [2022-04-15 00:04:08,087 INFO L272 TraceCheckUtils]: 7: Hoare triple {584#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {604#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:04:08,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {584#true} is VALID [2022-04-15 00:04:08,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {584#true} is VALID [2022-04-15 00:04:08,088 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {584#true} {584#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {584#true} is VALID [2022-04-15 00:04:08,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {584#true} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {584#true} is VALID [2022-04-15 00:04:08,088 INFO L272 TraceCheckUtils]: 12: Hoare triple {584#true} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {584#true} is VALID [2022-04-15 00:04:08,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:08,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {605#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:04:08,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {606#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [108] L19-->L19-2: Formula: (and (= (- 1) v_linear_search_~j~0_4) (= (mod v_linear_search_~j~0_5 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_5} OutVars{linear_search_~j~0=v_linear_search_~j~0_4} AuxVars[] AssignedVars[linear_search_~j~0] {585#false} is VALID [2022-04-15 00:04:08,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {585#false} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {585#false} is VALID [2022-04-15 00:04:08,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {585#false} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {585#false} is VALID [2022-04-15 00:04:08,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {585#false} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {585#false} is VALID [2022-04-15 00:04:08,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {585#false} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {585#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {585#false} {584#true} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {585#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L272 TraceCheckUtils]: 25: Hoare triple {585#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {585#false} is VALID [2022-04-15 00:04:08,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {585#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {585#false} is VALID [2022-04-15 00:04:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:08,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9540023] [2022-04-15 00:04:08,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9540023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:04:08,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:04:08,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:04:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531919230] [2022-04-15 00:04:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:04:08,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-15 00:04:08,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:04:08,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:08,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:08,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:04:08,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:04:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:04:08,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:04:08,129 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:08,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:08,517 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-04-15 00:04:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:04:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-15 00:04:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:04:08,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 00:04:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:08,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-04-15 00:04:08,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-04-15 00:04:08,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:04:08,588 INFO L225 Difference]: With dead ends: 50 [2022-04-15 00:04:08,588 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 00:04:08,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:04:08,589 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 61 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:04:08,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 31 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:04:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 00:04:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-04-15 00:04:08,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:04:08,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:08,604 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:08,604 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:08,606 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 00:04:08,606 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 00:04:08,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:08,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:08,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 00:04:08,607 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 37 states. [2022-04-15 00:04:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:04:08,609 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 00:04:08,609 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 00:04:08,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:04:08,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:04:08,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:04:08,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:04:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:04:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-15 00:04:08,611 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-04-15 00:04:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:04:08,612 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-15 00:04:08,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 00:04:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-15 00:04:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:04:08,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:04:08,613 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:04:08,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:04:08,613 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:04:08,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:04:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash -374135970, now seen corresponding path program 1 times [2022-04-15 00:04:08,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:04:08,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471170340] [2022-04-15 00:04:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:04:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:04:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:08,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {820#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:08,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:08,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {799#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:08,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:04:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:08,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {799#true} is VALID [2022-04-15 00:04:08,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:04:08,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:08,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:04:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:09,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {823#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:09,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {823#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 00:04:09,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} [109] L19-->L19-2: Formula: (not (= (mod v_linear_search_~j~0_7 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_7} OutVars{linear_search_~j~0=v_linear_search_~j~0_7} AuxVars[] AssignedVars[] {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 00:04:09,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {826#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 00:04:09,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {826#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 00:04:09,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 00:04:09,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:04:09,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:04:09,100 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {800#false} is VALID [2022-04-15 00:04:09,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {820#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:04:09,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {820#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:09,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:09,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {821#(and (<= 100000 ~MAX~0) (<= ~MAX~0 100000))} {799#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:09,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:09,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} is VALID [2022-04-15 00:04:09,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {804#(and (not (<= (+ (div ~MAX~0 4294967296) 1) 0)) (<= ~MAX~0 100000))} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,107 INFO L272 TraceCheckUtils]: 7: Hoare triple {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {822#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:04:09,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {799#true} is VALID [2022-04-15 00:04:09,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {799#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:04:09,109 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {799#true} {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,110 INFO L272 TraceCheckUtils]: 12: Hoare triple {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {799#true} is VALID [2022-04-15 00:04:09,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {799#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {823#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:04:09,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {823#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-15 00:04:09,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {824#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 00:04:09,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} [109] L19-->L19-2: Formula: (not (= (mod v_linear_search_~j~0_7 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_7} OutVars{linear_search_~j~0=v_linear_search_~j~0_7} AuxVars[] AssignedVars[] {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} is VALID [2022-04-15 00:04:09,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {825#(and (<= linear_search_~j~0 1) (or (<= linear_search_~n (+ linear_search_~j~0 4294967294 (* (div linear_search_~n 4294967296) 4294967296))) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0))))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {826#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} is VALID [2022-04-15 00:04:09,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {826#(and (<= linear_search_~j~0 1) (or (< 0 (+ (div linear_search_~j~0 4294967296) 1)) (not |linear_search_#t~short5|)))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 00:04:09,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-15 00:04:09,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {827#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:04:09,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:04:09,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {828#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {805#(and (<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0) (<= ~SIZE~0 (+ 99999 (* (div ~SIZE~0 4294967296) 4294967296))))} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {800#false} is VALID [2022-04-15 00:04:09,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:04:09,123 INFO L272 TraceCheckUtils]: 25: Hoare triple {800#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {800#false} is VALID [2022-04-15 00:04:09,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {800#false} is VALID [2022-04-15 00:04:09,123 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:04:09,123 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:04:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:04:09,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:04:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471170340] [2022-04-15 00:04:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471170340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:04:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057576408] [2022-04-15 00:04:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:04:09,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:04:09,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:04:09,126 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-15 00:04:09,152 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-15 00:04:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:04:09,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 00:04:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-15 00:04:11,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:04:11,486 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-15 00:04:11,615 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 28 treesize of output 23 [2022-04-15 00:04:18,023 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base)))) is different from false [2022-04-15 00:04:24,455 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-04-15 00:04:30,920 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-04-15 00:04:59,424 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-04-15 00:05:06,032 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|)))) is different from false [2022-04-15 00:05:12,963 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (<= (mod c_~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (< aux_mod_linear_search_~j~0_35 4294967296) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset))))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38)))) is different from false [2022-04-15 00:05:21,251 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-04-15 00:05:21,252 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 52 treesize of output 46 [2022-04-15 00:05:36,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:05:36,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {799#true} is VALID [2022-04-15 00:05:36,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:05:36,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:05:36,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {799#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {799#true} is VALID [2022-04-15 00:05:36,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {799#true} is VALID [2022-04-15 00:05:36,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {850#(< 1 (mod ~SIZE~0 4294967296))} is VALID [2022-04-15 00:05:36,666 INFO L272 TraceCheckUtils]: 7: Hoare triple {850#(< 1 (mod ~SIZE~0 4294967296))} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {850#(< 1 (mod ~SIZE~0 4294967296))} is VALID [2022-04-15 00:05:36,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {850#(< 1 (mod ~SIZE~0 4294967296))} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {857#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-15 00:05:36,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {857#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {857#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-15 00:05:36,668 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {857#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} {850#(< 1 (mod ~SIZE~0 4294967296))} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {864#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-15 00:05:36,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {864#(and (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {868#(and (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-15 00:05:38,827 WARN L272 TraceCheckUtils]: 12: Hoare triple {868#(and (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {872#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-15 00:05:40,977 WARN L290 TraceCheckUtils]: 13: Hoare triple {872#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:43,116 WARN L290 TraceCheckUtils]: 14: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:45,255 WARN L290 TraceCheckUtils]: 15: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:47,390 WARN L290 TraceCheckUtils]: 16: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:49,523 WARN L290 TraceCheckUtils]: 17: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [109] L19-->L19-2: Formula: (not (= (mod v_linear_search_~j~0_7 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_7} OutVars{linear_search_~j~0=v_linear_search_~j~0_7} AuxVars[] AssignedVars[] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:51,740 WARN L290 TraceCheckUtils]: 18: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} is UNKNOWN [2022-04-15 00:05:53,879 WARN L290 TraceCheckUtils]: 19: Hoare triple {876#(and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (= |linear_search_#in~a.base| linear_search_~a.base) (< 1 (mod ~SIZE~0 4294967296)) (= |linear_search_#in~q| linear_search_~q))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {895#(and (exists ((linear_search_~a.offset Int)) (and (or (and (not |linear_search_#t~short5|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|)) (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|)))) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-15 00:05:56,021 WARN L290 TraceCheckUtils]: 20: Hoare triple {895#(and (exists ((linear_search_~a.offset Int)) (and (or (and (not |linear_search_#t~short5|) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|)) (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|)))) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {899#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)) (exists ((linear_search_~a.offset Int)) (and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|))))} is UNKNOWN [2022-04-15 00:05:58,159 WARN L290 TraceCheckUtils]: 21: Hoare triple {899#(and (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)) (exists ((linear_search_~a.offset Int)) (and (<= |linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|))))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {903#(and (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (< aux_mod_linear_search_~j~0_35 4294967296) (<= (mod ~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-15 00:06:00,296 WARN L290 TraceCheckUtils]: 22: Hoare triple {903#(and (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (< aux_mod_linear_search_~j~0_35 4294967296) (<= (mod ~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {903#(and (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (< aux_mod_linear_search_~j~0_35 4294967296) (<= (mod ~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} is UNKNOWN [2022-04-15 00:06:02,472 WARN L284 TraceCheckUtils]: 23: Hoare quadruple {903#(and (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (< aux_mod_linear_search_~j~0_35 4294967296) (<= (mod ~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset)) |linear_search_#in~q|) (<= |linear_search_#in~a.offset| linear_search_~a.offset))) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (store ((as const (Array Int Int)) 0) (+ v_main_~a~0.offset_BEFORE_CALL_1 (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1))) (< 1 (mod ~SIZE~0 4294967296)))} {868#(and (exists ((v_ArrVal_38 Int)) (= (select |#memory_int| main_~a~0.base) (store ((as const (Array Int Int)) 0) (+ main_~a~0.offset (* (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 4)) v_ArrVal_38))) (< 1 (mod ~SIZE~0 4294967296)))} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {800#false} is UNKNOWN [2022-04-15 00:06:02,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:06:02,472 INFO L272 TraceCheckUtils]: 25: Hoare triple {800#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {800#false} is VALID [2022-04-15 00:06:02,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {800#false} is VALID [2022-04-15 00:06:02,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:06:02,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {800#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {800#false} is VALID [2022-04-15 00:06:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-04-15 00:06:02,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:06:03,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057576408] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:06:03,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 00:06:03,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2022-04-15 00:06:03,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590131062] [2022-04-15 00:06:03,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-15 00:06:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-04-15 00:06:03,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:06:03,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 00:06:27,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 41 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-15 00:06:27,624 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 00:06:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:06:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 00:06:27,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=237, Unknown=6, NotChecked=210, Total=506 [2022-04-15 00:06:27,626 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 00:06:32,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-04-15 00:06:34,674 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div c_~SIZE~0 4294967296) 4294967296))) (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_~SIZE~0 (+ .cse0 99999)) (<= (+ 2 .cse0) c_~SIZE~0) (exists ((v_ArrVal_38 Int)) (= (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) c_main_~a~0.offset) v_ArrVal_38) (select |c_#memory_int| c_main_~a~0.base))))) is different from false [2022-04-15 00:06:36,831 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 c_linear_search_~j~0) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-04-15 00:06:38,980 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296)))) is different from false [2022-04-15 00:06:41,133 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 0) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296)))) is different from false [2022-04-15 00:06:43,305 WARN L833 $PredicateComparison]: unable to prove that (and (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset) (or (not (<= (+ (div c_linear_search_~j~0 4294967296) 1) 0)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967294 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-04-15 00:06:45,467 WARN L833 $PredicateComparison]: unable to prove that (and (or (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (not |c_linear_search_#t~short5|)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-04-15 00:06:47,625 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-04-15 00:06:49,770 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 (mod c_~SIZE~0 4294967296)) (<= c_linear_search_~j~0 1) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|)))) is different from false [2022-04-15 00:06:51,945 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((linear_search_~a.offset Int)) (and (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (let ((.cse0 (= (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod c_linear_search_~j~0 4294967296) 4) linear_search_~a.offset)) |c_linear_search_#in~q|))) (or (and .cse0 (not |c_linear_search_#t~short5|)) (and (not .cse0) |c_linear_search_#t~short5|))))) (< 1 (mod c_~SIZE~0 4294967296)) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (<= |c_linear_search_#in~a.offset| c_linear_search_~a.offset)) is different from false [2022-04-15 00:06:54,133 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< 1 (mod c_~SIZE~0 4294967296)) (= |c_old(#memory_int)| |c_#memory_int|) (exists ((aux_mod_linear_search_~j~0_35 Int) (linear_search_~a.offset Int)) (and (<= (mod c_~SIZE~0 4294967296) aux_mod_linear_search_~j~0_35) (<= |c_linear_search_#in~a.offset| linear_search_~a.offset) (< aux_mod_linear_search_~j~0_35 4294967296) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* (mod aux_mod_linear_search_~j~0_35 4294967296) 4) linear_search_~a.offset))))) (= c_~MAX~0 |c_old(~MAX~0)|) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (v_ArrVal_38 Int) (v_main_~a~0.offset_BEFORE_CALL_1 Int)) (= (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_1) (store ((as const (Array Int Int)) 0) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_1) v_ArrVal_38))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0)) is different from false [2022-04-15 00:06:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:06:54,192 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-15 00:06:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 00:06:54,192 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2022-04-15 00:06:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:06:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 00:06:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-15 00:06:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 00:06:54,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-15 00:06:54,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 57 transitions. [2022-04-15 00:07:32,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 39 inductive. 0 not inductive. 18 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:32,741 INFO L225 Difference]: With dead ends: 52 [2022-04-15 00:07:32,741 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 00:07:32,742 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=140, Invalid=558, Unknown=16, NotChecked=1008, Total=1722 [2022-04-15 00:07:32,742 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:32,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 74 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 86 Invalid, 1 Unknown, 93 Unchecked, 2.2s Time] [2022-04-15 00:07:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 00:07:32,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-15 00:07:32,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:32,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:32,770 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:32,771 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:32,773 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 00:07:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-15 00:07:32,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:32,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:32,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 00:07:32,774 INFO L87 Difference]: Start difference. First operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-15 00:07:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:32,775 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 00:07:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-15 00:07:32,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:32,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:32,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:32,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:32,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-15 00:07:32,778 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-04-15 00:07:32,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:32,778 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-15 00:07:32,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 18 states have internal predecessors, (37), 6 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 00:07:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 00:07:32,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:07:32,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:32,779 INFO L499 BasicCegarLoop]: trace histogram [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] [2022-04-15 00:07:32,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:07:32,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:32,996 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -570649475, now seen corresponding path program 1 times [2022-04-15 00:07:32,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:32,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143390530] [2022-04-15 00:07:32,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:32,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {1201#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {1181#true} is VALID [2022-04-15 00:07:33,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1181#true} {1181#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-15 00:07:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {1202#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1181#true} is VALID [2022-04-15 00:07:33,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1181#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1181#true} {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:07:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 00:07:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:33,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {1181#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,259 INFO L290 TraceCheckUtils]: 3: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [109] L19-->L19-2: Formula: (not (= (mod v_linear_search_~j~0_7 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_7} OutVars{linear_search_~j~0=v_linear_search_~j~0_7} AuxVars[] AssignedVars[] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [99] L17-1-->L17-3: Formula: (not |v_linear_search_#t~short5_8|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_8|} OutVars{linear_search_#t~short5=|v_linear_search_#t~short5_8|} AuxVars[] AssignedVars[] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:07:33,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:07:33,264 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {1182#false} is VALID [2022-04-15 00:07:33,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {1181#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1201#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:33,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1201#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [77] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_6| 1))) (and (= 16 (select |v_#length_3| 2)) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_3| 1) 1) (= (select .cse0 0) 48) (= (select |v_#valid_3| 3) 1) (= |v_#NULL.base_1| 0) (= (select |v_#valid_3| 0) 0) (= 100000 v_~MAX~0_3) (= (select |v_#valid_3| 2) 1) (= |v_#NULL.offset_1| 0) (= (select .cse0 1) 0) (= 12 (select |v_#length_3| 3)) (= v_~SIZE~0_9 0))) InVars {#memory_int=|v_#memory_int_6|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{~SIZE~0=v_~SIZE~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_3|, ~MAX~0=v_~MAX~0_3, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~SIZE~0, #NULL.offset, ~MAX~0, #NULL.base] {1181#true} is VALID [2022-04-15 00:07:33,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1181#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1181#true} {1181#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {1181#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1181#true} [79] mainENTRY-->L27: Formula: (= v_~SIZE~0_3 (+ 1 (div (mod |v_main_#t~nondet7_2| 4294967296) 2))) InVars {main_#t~nondet7=|v_main_#t~nondet7_2|} OutVars{~SIZE~0=v_~SIZE~0_3} AuxVars[] AssignedVars[~SIZE~0, main_#t~nondet7] {1181#true} is VALID [2022-04-15 00:07:33,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (= (store |v_#length_2| |v_main_#t~malloc8.base_1| (* .cse0 4)) |v_#length_1|) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_#t~malloc8.base_1| 1)) (< |v_main_#t~malloc8.base_1| |v_#StackHeapBarrier_1|) (not (= |v_main_#t~malloc8.base_1| 0)))) InVars {~SIZE~0=v_~SIZE~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, ~MAX~0=v_~MAX~0_1, #valid=|v_#valid_2|} OutVars{~SIZE~0=v_~SIZE~0_4, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_#t~malloc8.base=|v_main_#t~malloc8.base_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, ~MAX~0=v_~MAX~0_1} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #valid, #length] {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:07:33,272 INFO L272 TraceCheckUtils]: 7: Hoare triple {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [83] L28-->#Ultimate.meminitENTRY: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {1202#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-15 00:07:33,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(= |#memory_int| |old(#memory_int)|)} [86] #Ultimate.meminitENTRY-->#Ultimate.meminitFINAL: Formula: (= (store |v_#memory_int_10| |v_#Ultimate.meminit_#ptr.base_1| ((as const (Array Int Int)) 0)) |v_#memory_int_9|) InVars {#memory_int=|v_#memory_int_10|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} OutVars{#memory_int=|v_#memory_int_9|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.base_1|} AuxVars[] AssignedVars[#memory_int] {1181#true} is VALID [2022-04-15 00:07:33,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#true} is VALID [2022-04-15 00:07:33,274 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1181#true} {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (let ((.cse0 (mod v_~SIZE~0_14 4294967296))) (and (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|) (= (* .cse0 4) |v_#Ultimate.meminit_#productInParam_1|) (= .cse0 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|))) InVars {~SIZE~0=v_~SIZE~0_14, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_4|, main_#t~malloc8.base=|v_main_#t~malloc8.base_4|} OutVars{~SIZE~0=v_~SIZE~0_14, #Ultimate.meminit_#sizeOfFields=|v_#Ultimate.meminit_#sizeOfFieldsInParam_1|, #Ultimate.meminit_#amountOfFields=|v_#Ultimate.meminit_#amountOfFieldsInParam_1|, #Ultimate.meminit_#product=|v_#Ultimate.meminit_#productInParam_1|, #Ultimate.meminit_#ptr.base=|v_#Ultimate.meminit_#ptr.baseInParam_1|, #Ultimate.meminit_#ptr.offset=|v_#Ultimate.meminit_#ptr.offsetInParam_1|} AuxVars[] AssignedVars[main_#t~malloc8.offset, main_#t~malloc8.base, #Ultimate.meminit_#sizeOfFields, #Ultimate.meminit_#amountOfFields, #Ultimate.meminit_#product, #Ultimate.meminit_#ptr.base, #Ultimate.meminit_#ptr.offset] {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:07:33,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [85] L28-1-->L30: Formula: (and (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|) (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ (* (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_1) 3)) |v_#memory_int_4|)) InVars {~SIZE~0=v_~SIZE~0_6, #memory_int=|v_#memory_int_5|, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|} OutVars{~SIZE~0=v_~SIZE~0_6, main_#t~malloc8.offset=|v_main_#t~malloc8.offset_3|, main_#t~malloc8.base=|v_main_#t~malloc8.base_3|, #memory_int=|v_#memory_int_4|, main_~a~0.base=v_main_~a~0.base_1, main_~a~0.offset=v_main_~a~0.offset_1} AuxVars[] AssignedVars[#memory_int, main_~a~0.base, main_~a~0.offset] {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-15 00:07:33,276 INFO L272 TraceCheckUtils]: 12: Hoare triple {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [87] L30-->linear_searchENTRY: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {1181#true} is VALID [2022-04-15 00:07:33,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1181#true} [90] linear_searchENTRY-->L19-2: Formula: (and (= v_linear_search_~j~0_1 0) (= |v_linear_search_#in~a.base_1| v_linear_search_~a.base_1) (= |v_linear_search_#in~a.offset_1| v_linear_search_~a.offset_1) (= |v_linear_search_#in~n_1| v_linear_search_~n_1) (= |v_linear_search_#in~q_1| v_linear_search_~q_1)) InVars {linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|, linear_search_#in~q=|v_linear_search_#in~q_1|} OutVars{linear_search_~n=v_linear_search_~n_1, linear_search_~a.base=v_linear_search_~a.base_1, linear_search_~q=v_linear_search_~q_1, linear_search_#in~n=|v_linear_search_#in~n_1|, linear_search_#in~a.offset=|v_linear_search_#in~a.offset_1|, linear_search_#in~q=|v_linear_search_#in~q_1|, linear_search_~j~0=v_linear_search_~j~0_1, linear_search_~a.offset=v_linear_search_~a.offset_1, linear_search_#in~a.base=|v_linear_search_#in~a.base_1|} AuxVars[] AssignedVars[linear_search_~n, linear_search_~a.base, linear_search_~q, linear_search_~j~0, linear_search_~a.offset] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (let ((.cse0 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse0) |v_linear_search_#t~short5_6|) (and .cse0 (not |v_linear_search_#t~short5_6|)))) (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (mod v_linear_search_~j~0_8 4294967296) 4) v_linear_search_~a.offset_2))) |v_linear_search_#t~short5_7|) InVars {linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_7|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2} OutVars{linear_search_~a.base=v_linear_search_~a.base_2, linear_search_#t~short5=|v_linear_search_#t~short5_6|, linear_search_~q=v_linear_search_~q_2, #memory_int=|v_#memory_int_1|, linear_search_~j~0=v_linear_search_~j~0_8, linear_search_~a.offset=v_linear_search_~a.offset_2, linear_search_#t~mem4=|v_linear_search_#t~mem4_3|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-15 00:07:33,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1203#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [104] L17-3-->L19: Formula: (and (= (+ v_linear_search_~j~0_3 1) v_linear_search_~j~0_2) |v_linear_search_#t~short5_4|) InVars {linear_search_~j~0=v_linear_search_~j~0_3, linear_search_#t~short5=|v_linear_search_#t~short5_4|} OutVars{linear_search_~j~0=v_linear_search_~j~0_2, linear_search_#t~post6=|v_linear_search_#t~post6_1|, linear_search_#t~mem4=|v_linear_search_#t~mem4_2|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~post6, linear_search_~j~0, linear_search_#t~mem4] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [109] L19-->L19-2: Formula: (not (= (mod v_linear_search_~j~0_7 4294967296) 20)) InVars {linear_search_~j~0=v_linear_search_~j~0_7} OutVars{linear_search_~j~0=v_linear_search_~j~0_7} AuxVars[] AssignedVars[] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [93] L19-2-->L17-1: Formula: (let ((.cse0 (< (mod v_linear_search_~j~0_6 4294967296) (mod v_linear_search_~n_2 4294967296)))) (or (and |v_linear_search_#t~short5_5| .cse0) (and (not |v_linear_search_#t~short5_5|) (not .cse0)))) InVars {linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6} OutVars{linear_search_~n=v_linear_search_~n_2, linear_search_~j~0=v_linear_search_~j~0_6, linear_search_#t~short5=|v_linear_search_#t~short5_5|} AuxVars[] AssignedVars[linear_search_#t~short5] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [99] L17-1-->L17-3: Formula: (not |v_linear_search_#t~short5_8|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_8|} OutVars{linear_search_#t~short5=|v_linear_search_#t~short5_8|} AuxVars[] AssignedVars[] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [103] L17-3-->L17-5: Formula: (not |v_linear_search_#t~short5_2|) InVars {linear_search_#t~short5=|v_linear_search_#t~short5_2|} OutVars{linear_search_#t~mem4=|v_linear_search_#t~mem4_1|} AuxVars[] AssignedVars[linear_search_#t~short5, linear_search_#t~mem4] {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-15 00:07:33,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1204#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} [97] L17-5-->linear_searchFINAL: Formula: (and (not (< (mod v_linear_search_~j~0_10 4294967296) (mod v_~SIZE~0_2 4294967296))) (= |v_linear_search_#res_2| 0)) InVars {~SIZE~0=v_~SIZE~0_2, linear_search_~j~0=v_linear_search_~j~0_10} OutVars{~SIZE~0=v_~SIZE~0_2, linear_search_#res=|v_linear_search_#res_2|, linear_search_~j~0=v_linear_search_~j~0_10} AuxVars[] AssignedVars[linear_search_#res] {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:07:33,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 00:07:33,284 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1205#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1186#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [113] linear_searchEXIT-->L30-1: AOR: Formula: (= |v_main_#t~ret9_5| |v_linear_search_#resOutParam_1|) InVars {linear_search_#res=|v_linear_search_#resOutParam_1|} OutVars{main_#t~ret9=|v_main_#t~ret9_5|} AuxVars[] AssignedVars[linear_search_#res, main_#t~ret9] LVA: Formula: (and (= 3 |v_linear_search_#in~qInParam_1|) (= |v_linear_search_#in~a.offsetInParam_1| v_main_~a~0.offset_3) (= |v_linear_search_#in~a.baseInParam_1| v_main_~a~0.base_3) (= |v_linear_search_#in~nInParam_1| (let ((.cse0 (mod v_~SIZE~0_15 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))) InVars {~SIZE~0=v_~SIZE~0_15, main_~a~0.base=v_main_~a~0.base_3, main_~a~0.offset=v_main_~a~0.offset_3} OutVars{~SIZE~0=v_~SIZE~0_15, linear_search_#in~a.offset=|v_linear_search_#in~a.offsetInParam_1|, linear_search_#in~n=|v_linear_search_#in~nInParam_1|, linear_search_#in~a.base=|v_linear_search_#in~a.baseInParam_1|, linear_search_#in~q=|v_linear_search_#in~qInParam_1|} AuxVars[] AssignedVars[linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q, main_~a~0.base, linear_search_#in~a.base, main_~a~0.offset] {1182#false} is VALID [2022-04-15 00:07:33,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {1182#false} [89] L30-1-->L30-2: Formula: (and (<= 0 (+ |v_main_#t~ret9_2| 2147483648)) (<= |v_main_#t~ret9_2| 2147483647)) InVars {main_#t~ret9=|v_main_#t~ret9_2|} OutVars{main_#t~ret9=|v_main_#t~ret9_2|} AuxVars[] AssignedVars[] {1182#false} is VALID [2022-04-15 00:07:33,285 INFO L272 TraceCheckUtils]: 25: Hoare triple {1182#false} [91] L30-2-->__VERIFIER_assertENTRY: Formula: (= |v_main_#t~ret9_6| |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_#t~ret9=|v_main_#t~ret9_6|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_#t~ret9] {1182#false} is VALID [2022-04-15 00:07:33,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {1182#false} [95] __VERIFIER_assertENTRY-->L7: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1182#false} is VALID [2022-04-15 00:07:33,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {1182#false} [100] L7-->L8: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1182#false} is VALID [2022-04-15 00:07:33,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {1182#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1182#false} is VALID [2022-04-15 00:07:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:33,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143390530] [2022-04-15 00:07:33,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143390530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:33,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741263641] [2022-04-15 00:07:33,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:33,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:33,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:33,292 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-15 00:07:33,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process