/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 16:41:50,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 16:41:50,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 16:41:50,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 16:41:50,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 16:41:50,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 16:41:50,806 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 16:41:50,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 16:41:50,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 16:41:50,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 16:41:50,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 16:41:50,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 16:41:50,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 16:41:50,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 16:41:50,811 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 16:41:50,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 16:41:50,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 16:41:50,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 16:41:50,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 16:41:50,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 16:41:50,816 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 16:41:50,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 16:41:50,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 16:41:50,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 16:41:50,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 16:41:50,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 16:41:50,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 16:41:50,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 16:41:50,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 16:41:50,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 16:41:50,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 16:41:50,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 16:41:50,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 16:41:50,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 16:41:50,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 16:41:50,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 16:41:50,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 16:41:50,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 16:41:50,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 16:41:50,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 16:41:50,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 16:41:50,843 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 16:41:50,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 16:41:50,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 16:41:50,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 16:41:50,856 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 16:41:50,857 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 16:41:50,858 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 16:41:50,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:50,859 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 16:41:50,859 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 16:41:50,860 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 16:41:50,860 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-07 16:41:51,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 16:41:51,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 16:41:51,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 16:41:51,100 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 16:41:51,101 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 16:41:51,102 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-07 16:41:51,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa728552/b61f34f5e9a34725850079557e2ae392/FLAG2f496cdf2 [2022-04-07 16:41:51,480 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 16:41:51,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2022-04-07 16:41:51,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa728552/b61f34f5e9a34725850079557e2ae392/FLAG2f496cdf2 [2022-04-07 16:41:51,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0aa728552/b61f34f5e9a34725850079557e2ae392 [2022-04-07 16:41:51,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 16:41:51,927 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 16:41:51,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:51,929 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 16:41:51,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 16:41:51,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca7dba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:51, skipping insertion in model container [2022-04-07 16:41:51,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 04:41:51" (1/1) ... [2022-04-07 16:41:51,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 16:41:51,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 16:41:52,172 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-07 16:41:52,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:52,221 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 16:41:52,232 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-07 16:41:52,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 16:41:52,258 INFO L208 MainTranslator]: Completed translation [2022-04-07 16:41:52,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52 WrapperNode [2022-04-07 16:41:52,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 16:41:52,259 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 16:41:52,259 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 16:41:52,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 16:41:52,267 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 16:41:52,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 16:41:52,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 16:41:52,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 16:41:52,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (1/1) ... [2022-04-07 16:41:52,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 16:41:52,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:41:52,340 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-07 16:41:52,392 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-07 16:41:52,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 16:41:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 16:41:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 16:41:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 16:41:52,406 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2022-04-07 16:41:52,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 16:41:52,407 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 16:41:52,407 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 16:41:52,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 16:41:52,456 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 16:41:52,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 16:41:54,757 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 16:41:54,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 16:41:54,763 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 16:41:54,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:54 BoogieIcfgContainer [2022-04-07 16:41:54,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 16:41:54,765 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 16:41:54,765 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 16:41:54,765 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 16:41:54,767 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:54" (1/1) ... [2022-04-07 16:41:54,769 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 16:41:54,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:54 BasicIcfg [2022-04-07 16:41:54,787 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 16:41:54,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 16:41:54,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 16:41:54,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 16:41:54,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 04:41:51" (1/4) ... [2022-04-07 16:41:54,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff69ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:54, skipping insertion in model container [2022-04-07 16:41:54,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 04:41:52" (2/4) ... [2022-04-07 16:41:54,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff69ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 04:41:54, skipping insertion in model container [2022-04-07 16:41:54,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 04:41:54" (3/4) ... [2022-04-07 16:41:54,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff69ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 04:41:54, skipping insertion in model container [2022-04-07 16:41:54,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 04:41:54" (4/4) ... [2022-04-07 16:41:54,801 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.cJordan [2022-04-07 16:41:54,805 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 16:41:54,805 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 16:41:54,832 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 16:41:54,836 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-07 16:41:54,836 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 16:41:54,847 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-07 16:41:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 16:41:54,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:54,853 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-07 16:41:54,853 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1395824931, now seen corresponding path program 1 times [2022-04-07 16:41:54,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:54,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296494991] [2022-04-07 16:41:54,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:54,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,079 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-07 16:41:55,079 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-07 16:41:55,079 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-07 16:41:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,102 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-07 16:41:55,103 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-07 16:41:55,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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-07 16:41:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,116 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-07 16:41:55,117 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-07 16:41:55,117 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-07 16:41:55,117 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-07 16:41:55,118 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-07 16:41:55,119 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-07 16:41:55,119 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-07 16:41:55,120 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-07 16:41:55,120 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-07 16:41:55,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-07 16:41:55,120 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-07 16:41:55,121 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) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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-07 16:41:55,123 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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-07 16:41:55,124 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-07 16:41:55,124 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-07 16:41:55,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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-07 16:41:55,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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-07 16:41:55,125 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-07 16:41:55,126 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-07 16:41:55,127 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-07 16:41:55,127 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-07 16:41:55,127 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-07 16:41:55,128 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-07 16:41:55,128 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-07 16:41:55,129 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-07 16:41:55,129 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-07 16:41:55,129 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-07 16:41:55,129 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-07 16:41:55,130 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-07 16:41:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:55,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296494991] [2022-04-07 16:41:55,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296494991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:55,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:55,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 16:41:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018077419] [2022-04-07 16:41:55,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:55,138 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-07 16:41:55,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:55,141 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-07 16:41:55,184 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-07 16:41:55,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 16:41:55,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:55,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 16:41:55,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 16:41:55,201 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-07 16:41:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:55,439 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-07 16:41:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 16:41:55,439 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-07 16:41:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:55,440 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-07 16:41:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-07 16:41:55,446 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-07 16:41:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-07 16:41:55,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-07 16:41:55,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:55,500 INFO L225 Difference]: With dead ends: 36 [2022-04-07 16:41:55,500 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 16:41:55,501 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 16:41:55,503 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-07 16:41:55,504 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-07 16:41:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 16:41:55,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 16:41:55,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:55,522 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-07 16:41:55,522 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-07 16:41:55,523 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-07 16:41:55,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:55,525 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-07 16:41:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 16:41:55,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:55,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:55,526 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-07 16:41:55,526 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-07 16:41:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:55,528 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-07 16:41:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 16:41:55,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:55,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:55,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:55,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:55,529 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-07 16:41:55,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-07 16:41:55,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-04-07 16:41:55,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:55,532 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-07 16:41:55,532 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-07 16:41:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-07 16:41:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 16:41:55,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:55,533 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-07 16:41:55,533 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 16:41:55,533 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1369163817, now seen corresponding path program 1 times [2022-04-07 16:41:55,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:55,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750715386] [2022-04-07 16:41:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {192#(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] {174#true} is VALID [2022-04-07 16:41:55,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(= |#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] {174#true} is VALID [2022-04-07 16:41:55,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {174#true} {174#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {174#true} is VALID [2022-04-07 16:41:55,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:55,671 INFO L290 TraceCheckUtils]: 0: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {174#true} is VALID [2022-04-07 16:41:55,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {174#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] {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:55,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:55,674 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {174#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] {189#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:55,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {192#(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-07 16:41:55,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#(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] {174#true} is VALID [2022-04-07 16:41:55,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {174#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {174#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {174#true} is VALID [2022-04-07 16:41:55,677 INFO L272 TraceCheckUtils]: 7: Hoare triple {174#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {193#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:41:55,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(= |#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] {174#true} is VALID [2022-04-07 16:41:55,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-07 16:41:55,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {174#true} {174#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {174#true} is VALID [2022-04-07 16:41:55,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#true} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {174#true} is VALID [2022-04-07 16:41:55,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {174#true} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {174#true} is VALID [2022-04-07 16:41:55,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {174#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] {174#true} is VALID [2022-04-07 16:41:55,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {174#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] {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:55,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID [2022-04-07 16:41:55,682 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {194#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {174#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] {189#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:55,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {189#(= |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[] {189#(= |main_#t~ret9| 1)} is VALID [2022-04-07 16:41:55,683 INFO L272 TraceCheckUtils]: 21: Hoare triple {189#(= |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] {190#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-07 16:41:55,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {190#(= |__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] {191#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-07 16:41:55,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {191#(= __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[] {175#false} is VALID [2022-04-07 16:41:55,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {175#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#false} is VALID [2022-04-07 16:41:55,684 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-07 16:41:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:55,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750715386] [2022-04-07 16:41:55,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750715386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:55,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:55,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 16:41:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015080542] [2022-04-07 16:41:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:55,686 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-07 16:41:55,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:55,687 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-07 16:41:55,711 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-07 16:41:55,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:41:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:55,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:41:55,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:41:55,713 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-07 16:41:56,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:56,096 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-07 16:41:56,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 16:41:56,096 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-07 16:41:56,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:41:56,096 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-07 16:41:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-07 16:41:56,098 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-07 16:41:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-07 16:41:56,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-07 16:41:56,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:41:56,149 INFO L225 Difference]: With dead ends: 33 [2022-04-07 16:41:56,149 INFO L226 Difference]: Without dead ends: 27 [2022-04-07 16:41:56,150 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-07 16:41:56,151 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.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:41:56,151 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.1s Time] [2022-04-07 16:41:56,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-07 16:41:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-07 16:41:56,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:41:56,153 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-07 16:41:56,153 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-07 16:41:56,154 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-07 16:41:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:56,155 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 16:41:56,155 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 16:41:56,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:56,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:56,156 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-07 16:41:56,156 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-07 16:41:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:41:56,157 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-07 16:41:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 16:41:56,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:41:56,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:41:56,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:41:56,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:41:56,158 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-07 16:41:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-07 16:41:56,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-07 16:41:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:41:56,159 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-07 16:41:56,159 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-07 16:41:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-07 16:41:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-07 16:41:56,160 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:41:56,160 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-07 16:41:56,160 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 16:41:56,160 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:41:56,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:41:56,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1182993144, now seen corresponding path program 1 times [2022-04-07 16:41:56,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:41:56,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039888754] [2022-04-07 16:41:56,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:41:56,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:41:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:41:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:56,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(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] {320#true} is VALID [2022-04-07 16:41:56,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:41:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:56,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#(= |#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] {320#true} is VALID [2022-04-07 16:41:56,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,238 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {320#true} {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:56,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:41:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:41:56,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {320#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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(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] {339#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 16:41:56,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {339#(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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {338#(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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {338#(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] {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:56,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:56,343 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {325#(<= (+ 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] {321#false} is VALID [2022-04-07 16:41:56,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {336#(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-07 16:41:56,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {336#(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] {320#true} is VALID [2022-04-07 16:41:56,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#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] {320#true} is VALID [2022-04-07 16:41:56,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {320#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:56,346 INFO L272 TraceCheckUtils]: 7: Hoare triple {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {337#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:41:56,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= |#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] {320#true} is VALID [2022-04-07 16:41:56,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {320#true} is VALID [2022-04-07 16:41:56,347 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {320#true} {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:56,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {325#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:41:56,348 INFO L272 TraceCheckUtils]: 12: Hoare triple {325#(<= (+ 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] {320#true} is VALID [2022-04-07 16:41:56,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {320#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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {338#(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] {339#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 16:41:56,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {339#(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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {338#(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] {338#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:41:56,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {338#(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] {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:56,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID [2022-04-07 16:41:56,354 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {340#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {325#(<= (+ 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] {321#false} is VALID [2022-04-07 16:41:56,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {321#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[] {321#false} is VALID [2022-04-07 16:41:56,354 INFO L272 TraceCheckUtils]: 21: Hoare triple {321#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] {321#false} is VALID [2022-04-07 16:41:56,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {321#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] {321#false} is VALID [2022-04-07 16:41:56,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {321#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[] {321#false} is VALID [2022-04-07 16:41:56,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {321#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#false} is VALID [2022-04-07 16:41:56,355 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-07 16:41:56,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:41:56,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039888754] [2022-04-07 16:41:56,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039888754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:41:56,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:41:56,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-07 16:41:56,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502407070] [2022-04-07 16:41:56,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:41:56,356 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-07 16:41:56,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:41:56,356 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-07 16:41:56,374 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-07 16:41:56,374 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 16:41:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:41:56,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 16:41:56,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-07 16:41:56,375 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-07 16:42:00,733 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-07 16:42:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,109 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-07 16:42:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 16:42:01,109 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-07 16:42:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:01,110 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-07 16:42:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-07 16:42:01,111 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-07 16:42:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-07 16:42:01,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2022-04-07 16:42:01,154 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-07 16:42:01,155 INFO L225 Difference]: With dead ends: 32 [2022-04-07 16:42:01,155 INFO L226 Difference]: Without dead ends: 31 [2022-04-07 16:42:01,155 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-07 16:42:01,156 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s 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-07 16:42:01,156 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-07 16:42:01,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-07 16:42:01,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-04-07 16:42:01,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:01,158 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-07 16:42:01,159 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-07 16:42:01,159 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-07 16:42:01,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,160 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 16:42:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-07 16:42:01,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:01,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:01,161 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-07 16:42:01,161 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-07 16:42:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,162 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-07 16:42:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-04-07 16:42:01,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:01,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:01,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:01,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:01,163 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-07 16:42:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-07 16:42:01,164 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2022-04-07 16:42:01,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:01,164 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-07 16:42:01,164 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-07 16:42:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-07 16:42:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:42:01,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:01,165 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-07 16:42:01,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 16:42:01,165 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:01,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash -503218689, now seen corresponding path program 1 times [2022-04-07 16:42:01,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:01,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145255179] [2022-04-07 16:42:01,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#(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] {484#true} is VALID [2022-04-07 16:42:01,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:42:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#(= |#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] {484#true} is VALID [2022-04-07 16:42:01,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,220 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {484#true} {484#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {484#true} is VALID [2022-04-07 16:42:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:42:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {505#(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] {506#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:42:01,278 INFO L290 TraceCheckUtils]: 4: Hoare triple {506#(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] {485#false} is VALID [2022-04-07 16:42:01,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#false} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {485#false} is VALID [2022-04-07 16:42:01,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#false} is VALID [2022-04-07 16:42:01,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {485#false} {484#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] {485#false} is VALID [2022-04-07 16:42:01,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {484#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#(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-07 16:42:01,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(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] {484#true} is VALID [2022-04-07 16:42:01,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {484#true} {484#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {484#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {484#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] {484#true} is VALID [2022-04-07 16:42:01,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {484#true} is VALID [2022-04-07 16:42:01,281 INFO L272 TraceCheckUtils]: 7: Hoare triple {484#true} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {504#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:42:01,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(= |#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] {484#true} is VALID [2022-04-07 16:42:01,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {484#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {484#true} is VALID [2022-04-07 16:42:01,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {484#true} {484#true} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {484#true} is VALID [2022-04-07 16:42:01,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#true} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {484#true} is VALID [2022-04-07 16:42:01,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {484#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] {484#true} is VALID [2022-04-07 16:42:01,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {505#(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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {505#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {505#(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] {506#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:42:01,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {506#(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] {485#false} is VALID [2022-04-07 16:42:01,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {485#false} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {485#false} is VALID [2022-04-07 16:42:01,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {485#false} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {485#false} {484#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] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {485#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[] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L272 TraceCheckUtils]: 25: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {485#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] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {485#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[] {485#false} is VALID [2022-04-07 16:42:01,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {485#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {485#false} is VALID [2022-04-07 16:42:01,287 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-07 16:42:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:01,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145255179] [2022-04-07 16:42:01,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145255179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 16:42:01,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 16:42:01,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 16:42:01,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618617849] [2022-04-07 16:42:01,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 16:42:01,288 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-07 16:42:01,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:42:01,288 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-07 16:42:01,311 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-07 16:42:01,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 16:42:01,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:42:01,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 16:42:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-07 16:42:01,312 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-07 16:42:01,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,616 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 16:42:01,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-07 16:42:01,616 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-07 16:42:01,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:42:01,617 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-07 16:42:01,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 16:42:01,618 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-07 16:42:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-07 16:42:01,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-07 16:42:01,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 16:42:01,677 INFO L225 Difference]: With dead ends: 37 [2022-04-07 16:42:01,677 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 16:42:01,678 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-07 16:42:01,678 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-07 16:42:01,678 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-07 16:42:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 16:42:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2022-04-07 16:42:01,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:42:01,681 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-07 16:42:01,681 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-07 16:42:01,681 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-07 16:42:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,682 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 16:42:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 16:42:01,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:01,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:01,683 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-07 16:42:01,683 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-07 16:42:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:42:01,684 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-07 16:42:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 16:42:01,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:42:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:42:01,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:42:01,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:42:01,685 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-07 16:42:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-07 16:42:01,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 29 [2022-04-07 16:42:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:42:01,686 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-07 16:42:01,687 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-07 16:42:01,687 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-07 16:42:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:42:01,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:42:01,687 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-07 16:42:01,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 16:42:01,687 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:42:01,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:42:01,688 INFO L85 PathProgramCache]: Analyzing trace with hash -374135970, now seen corresponding path program 1 times [2022-04-07 16:42:01,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:42:01,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641684874] [2022-04-07 16:42:01,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:01,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:42:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:42:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#(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] {658#true} is VALID [2022-04-07 16:42:01,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {658#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:42:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {679#(= |#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] {658#true} is VALID [2022-04-07 16:42:01,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {658#true} {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:42:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:42:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:01,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {658#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] {680#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#(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] {681#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 16:42:01,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#(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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {681#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 16:42:01,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {681#(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] {682#(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-07 16:42:01,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {682#(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[] {682#(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-07 16:42:01,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#(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] {683#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 16:42:01,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {683#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {684#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:42:01,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {684#(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] {684#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:42:01,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {684#(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] {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:42:01,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:42:01,986 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {663#(<= (+ 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] {659#false} is VALID [2022-04-07 16:42:01,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {678#(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-07 16:42:01,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(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] {658#true} is VALID [2022-04-07 16:42:01,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#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] {658#true} is VALID [2022-04-07 16:42:01,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:42:01,991 INFO L272 TraceCheckUtils]: 7: Hoare triple {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {679#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:42:01,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= |#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] {658#true} is VALID [2022-04-07 16:42:01,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {658#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:42:01,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {658#true} {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:42:01,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {663#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:42:01,992 INFO L272 TraceCheckUtils]: 12: Hoare triple {663#(<= (+ 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] {658#true} is VALID [2022-04-07 16:42:01,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {658#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] {680#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:42:01,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#(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] {681#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 16:42:01,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {681#(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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {681#(and (<= linear_search_~j~0 0) (<= linear_search_~n (+ linear_search_~j~0 4294967295 (* (div linear_search_~n 4294967296) 4294967296))))} is VALID [2022-04-07 16:42:01,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {681#(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] {682#(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-07 16:42:02,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {682#(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[] {682#(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-07 16:42:02,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#(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] {683#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID [2022-04-07 16:42:02,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {683#(or (and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {684#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:42:02,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {684#(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] {684#(and (<= linear_search_~j~0 1) (< 0 (+ (div linear_search_~j~0 4294967296) 1)))} is VALID [2022-04-07 16:42:02,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {684#(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] {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:42:02,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:42:02,009 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {685#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {663#(<= (+ 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] {659#false} is VALID [2022-04-07 16:42:02,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {659#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[] {659#false} is VALID [2022-04-07 16:42:02,010 INFO L272 TraceCheckUtils]: 25: Hoare triple {659#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] {659#false} is VALID [2022-04-07 16:42:02,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {659#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] {659#false} is VALID [2022-04-07 16:42:02,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {659#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[] {659#false} is VALID [2022-04-07 16:42:02,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {659#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#false} is VALID [2022-04-07 16:42:02,011 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-07 16:42:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:42:02,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641684874] [2022-04-07 16:42:02,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641684874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:42:02,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828753647] [2022-04-07 16:42:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:42:02,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:42:02,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:42:02,026 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-07 16:42:02,029 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-07 16:42:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:42:02,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-07 16:42:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-07 16:42:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 16:42:04,478 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-07 16:42:04,586 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 72 treesize of output 65 [2022-04-07 16:42:15,250 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div .cse0 2) 4294967296) 2147483647) (< .cse0 4294967295) (< 1 .cse0) (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-07 16:42:21,658 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (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-07 16:42:28,080 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))))) is different from false [2022-04-07 16:42:52,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)))) is different from false [2022-04-07 16:42:58,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (< .cse7 4294967295) (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-07 16:43:04,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (< .cse1 4294967295) (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))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-04-07 16:43:12,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (< .cse0 4294967295) (< 1 .cse0) (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))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))))) is different from false [2022-04-07 16:43:33,822 WARN L232 SmtUtils]: Spent 12.64s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-04-07 16:43:33,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-07 16:43:33,823 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 153 treesize of output 153 [2022-04-07 16:43:36,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {658#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:43:36,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {658#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] {658#true} is VALID [2022-04-07 16:43:36,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {658#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:43:36,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {658#true} {658#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:43:36,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {658#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {658#true} is VALID [2022-04-07 16:43:36,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {658#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] {658#true} is VALID [2022-04-07 16:43:36,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {658#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {707#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 16:43:36,364 INFO L272 TraceCheckUtils]: 7: Hoare triple {707#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {707#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 16:43:36,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 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] {714#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 16:43:36,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((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[] {714#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 16:43:36,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {714#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) (< 1 (mod ~SIZE~0 4294967296)))} {707#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< 1 (mod ~SIZE~0 4294967296)))} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {721#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} is VALID [2022-04-07 16:43:38,497 WARN L290 TraceCheckUtils]: 11: Hoare triple {721#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc8.base|)) (< 1 (mod ~SIZE~0 4294967296)))} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {725#(and (<= (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 2147483647) (< (mod ~SIZE~0 4294967296) 4294967295) (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 UNKNOWN [2022-04-07 16:43:40,625 WARN L272 TraceCheckUtils]: 12: Hoare triple {725#(and (<= (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 2147483647) (< (mod ~SIZE~0 4294967296) 4294967295) (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] {729#(and (< (mod ~SIZE~0 4294967296) 4294967295) (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-07 16:43:42,751 WARN L290 TraceCheckUtils]: 13: Hoare triple {729#(and (< (mod ~SIZE~0 4294967296) 4294967295) (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] {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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-07 16:43:44,884 WARN L290 TraceCheckUtils]: 14: Hoare triple {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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] {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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-07 16:43:47,019 WARN L290 TraceCheckUtils]: 15: Hoare triple {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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-07 16:43:49,157 WARN L290 TraceCheckUtils]: 16: Hoare triple {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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] {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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-07 16:43:51,297 WARN L290 TraceCheckUtils]: 17: Hoare triple {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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[] {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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-07 16:43:53,428 WARN L290 TraceCheckUtils]: 18: Hoare triple {733#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |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] {749#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (< (mod linear_search_~j~0 4294967296) 4294967295) (not |linear_search_#t~short5|)) (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-07 16:43:55,565 WARN L290 TraceCheckUtils]: 19: Hoare triple {749#(and (< (mod ~SIZE~0 4294967296) 4294967295) (= |linear_search_#in~a.offset| linear_search_~a.offset) (or (< (mod linear_search_~j~0 4294967296) 4294967295) (not |linear_search_#t~short5|)) (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 (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {753#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (and (not (<= (mod linear_search_~j~0 4294967296) 2147483647)) (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|)))) (and (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|))) (<= (mod linear_search_~j~0 4294967296) 2147483647))) (< (mod linear_search_~j~0 4294967296) 4294967295) (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-07 16:43:57,699 WARN L290 TraceCheckUtils]: 20: Hoare triple {753#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (and (not (<= (mod linear_search_~j~0 4294967296) 2147483647)) (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|)))) (and (or (and |linear_search_#t~short5| (not (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|))) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not |linear_search_#t~short5|))) (<= (mod linear_search_~j~0 4294967296) 2147483647))) (< (mod linear_search_~j~0 4294967296) 4294967295) (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] {757#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< (mod linear_search_~j~0 4294967296) 4294967295) (or (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (<= (mod linear_search_~j~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not (<= (mod linear_search_~j~0 4294967296) 2147483647)))) (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-07 16:43:59,826 WARN L290 TraceCheckUtils]: 21: Hoare triple {757#(and (< (mod ~SIZE~0 4294967296) 4294967295) (< (mod linear_search_~j~0 4294967296) 4294967295) (or (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (<= (mod linear_search_~j~0 4294967296) 2147483647)) (and (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* (mod linear_search_~j~0 4294967296) 4))) |linear_search_#in~q|) (not (<= (mod linear_search_~j~0 4294967296) 2147483647)))) (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)))} [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] {761#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (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-07 16:44:01,963 WARN L290 TraceCheckUtils]: 22: Hoare triple {761#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (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[] {761#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (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-07 16:44:04,099 WARN L284 TraceCheckUtils]: 23: Hoare quadruple {761#(and (< (mod ~SIZE~0 4294967296) 4294967295) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ (- 17179869184) |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (and (<= (mod ~SIZE~0 4294967296) (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (= (select (select |#memory_int| |linear_search_#in~a.base|) (+ |linear_search_#in~a.offset| (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)))) |linear_search_#in~q|) (<= 0 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296)) 4294967295) (< (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) 4294967296)))) (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)))} {725#(and (<= (mod (div (mod ~SIZE~0 4294967296) 2) 4294967296) 2147483647) (< (mod ~SIZE~0 4294967296) 4294967295) (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] {659#false} is UNKNOWN [2022-04-07 16:44:04,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {659#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[] {659#false} is VALID [2022-04-07 16:44:04,100 INFO L272 TraceCheckUtils]: 25: Hoare triple {659#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] {659#false} is VALID [2022-04-07 16:44:04,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {659#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] {659#false} is VALID [2022-04-07 16:44:04,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {659#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[] {659#false} is VALID [2022-04-07 16:44:04,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {659#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {659#false} is VALID [2022-04-07 16:44:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-04-07 16:44:04,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 16:44:08,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828753647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:44:08,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 16:44:08,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-04-07 16:44:08,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472455914] [2022-04-07 16:44:08,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 16:44:08,431 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-07 16:44:08,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 16:44:08,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 16:44:36,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 36 inductive. 0 not inductive. 13 times theorem prover too weak to decide inductivity. [2022-04-07 16:44:36,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 16:44:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 16:44:36,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 16:44:36,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=179, Unknown=7, NotChecked=224, Total=462 [2022-04-07 16:44:36,230 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 16:44:40,691 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-07 16:44:42,986 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (<= (mod (div .cse0 2) 4294967296) 2147483647) (< .cse0 4294967295) (< 1 .cse0) (<= (+ 2 (* (div c_~SIZE~0 4294967296) 4294967296)) 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-07 16:44:45,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (<= 0 c_linear_search_~j~0) (< .cse0 4294967295) (< 1 .cse0) (<= 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))))) is different from false [2022-04-07 16:44:47,276 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) (not |c_linear_search_#t~short5|)) (<= c_linear_search_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-04-07 16:44:49,427 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= 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) (< .cse7 4294967295) (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_~n (+ c_linear_search_~j~0 4294967295 (* (div c_linear_search_~n 4294967296) 4294967296))))) is different from false [2022-04-07 16:44:51,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (<= 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))) (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-07 16:44:53,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (not |c_linear_search_#t~short5|))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (= 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))) (or (< (mod c_linear_search_~j~0 4294967296) 4294967295) .cse1) (or (and (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (<= c_linear_search_~j~0 1)) .cse1))) is different from false [2022-04-07 16:44:55,853 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (<= 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) (< .cse7 4294967295) (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-07 16:44:57,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse1 (mod c_linear_search_~j~0 4294967296))) (and (< .cse0 4294967295) (< 0 (+ (div c_linear_search_~j~0 4294967296) 1)) (< 1 .cse0) (<= c_linear_search_~j~0 1) (< .cse1 4294967295) (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))) (let ((.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse1 4)) (.cse2 (<= .cse1 2147483647))) (or (and .cse2 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|)) (and (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))) (not .cse2)))))) is different from false [2022-04-07 16:45:00,170 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296)) (.cse7 (mod c_linear_search_~j~0 4294967296))) (and (= c_linear_search_~a.offset |c_linear_search_#in~a.offset|) (< .cse0 4294967295) (< 1 .cse0) (let ((.cse5 (<= .cse7 2147483647)) (.cse2 (not |c_linear_search_#t~short5|)) (.cse3 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse4 (* .cse7 4))) (or (and (let ((.cse1 (= |c_linear_search_#in~q| (select .cse3 (+ (- 17179869184) .cse4 |c_linear_search_#in~a.offset|))))) (or (and (not .cse1) |c_linear_search_#t~short5|) (and .cse1 .cse2))) (not .cse5)) (and .cse5 (let ((.cse6 (= (select .cse3 (+ .cse4 |c_linear_search_#in~a.offset|)) |c_linear_search_#in~q|))) (or (and (not .cse6) |c_linear_search_#t~short5|) (and .cse6 .cse2)))))) (= c_linear_search_~a.base |c_linear_search_#in~a.base|) (= |c_linear_search_#in~q| c_linear_search_~q) (< .cse7 4294967295) (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-07 16:45:04,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~SIZE~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (< .cse0 4294967295) (< 1 .cse0) (= |c_old(#memory_int)| |c_#memory_int|) (= 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))) (or (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse3 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse1 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse2 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse3))) (and (<= 0 .cse1) (< aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296) (< 2147483647 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (- 17179869184) (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (< .cse1 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse2) (< .cse2 4294967296))))) (exists ((aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int) (aux_div_aux_mod_linear_search_~j~0_35_46 Int) (aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 Int)) (let ((.cse6 (* aux_div_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296))) (let ((.cse4 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6 (* aux_div_aux_mod_linear_search_~j~0_35_46 4294967296))) (.cse5 (+ aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 .cse6))) (and (<= aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 2147483647) (<= 0 .cse4) (= |c_linear_search_#in~q| (select (select |c_#memory_int| |c_linear_search_#in~a.base|) (+ (* 4 (mod aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57 4294967296)) |c_linear_search_#in~a.offset|))) (<= 0 aux_mod_aux_mod_aux_mod_linear_search_~j~0_35_46_57) (< .cse4 4294967295) (<= (mod c_~SIZE~0 4294967296) .cse5) (< .cse5 4294967296)))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (= |c_old(~SIZE~0)| c_~SIZE~0))) is different from false [2022-04-07 16:45:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:45:04,539 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-04-07 16:45:04,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-07 16:45:04,540 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-04-07 16:45:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 16:45:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 16:45:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 50 transitions. [2022-04-07 16:45:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 16:45:04,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 50 transitions. [2022-04-07 16:45:04,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 50 transitions. [2022-04-07 16:45:45,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 31 inductive. 0 not inductive. 19 times theorem prover too weak to decide inductivity. [2022-04-07 16:45:45,085 INFO L225 Difference]: With dead ends: 44 [2022-04-07 16:45:45,085 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 16:45:45,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=106, Invalid=365, Unknown=17, NotChecked=918, Total=1406 [2022-04-07 16:45:45,086 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 16:45:45,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 1 Unknown, 106 Unchecked, 2.1s Time] [2022-04-07 16:45:45,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 16:45:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2022-04-07 16:45:45,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 16:45:45,089 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-07 16:45:45,089 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-07 16:45:45,089 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-07 16:45:45,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:45:45,090 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-07 16:45:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-07 16:45:45,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:45:45,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:45:45,091 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-07 16:45:45,091 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-07 16:45:45,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 16:45:45,092 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-07 16:45:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-04-07 16:45:45,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 16:45:45,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 16:45:45,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 16:45:45,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 16:45:45,092 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-07 16:45:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-07 16:45:45,093 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 29 [2022-04-07 16:45:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 16:45:45,093 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-07 16:45:45,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 5 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-07 16:45:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-07 16:45:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 16:45:45,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 16:45:45,094 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-07 16:45:45,127 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-07 16:45:45,312 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-07 16:45:45,312 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 16:45:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 16:45:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash -570649475, now seen corresponding path program 1 times [2022-04-07 16:45:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 16:45:45,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570348638] [2022-04-07 16:45:45,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:45:45,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 16:45:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:45:45,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 16:45:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:45:45,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {1017#(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] {997#true} is VALID [2022-04-07 16:45:45,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {997#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {997#true} {997#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-07 16:45:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:45:45,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {1018#(= |#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] {997#true} is VALID [2022-04-07 16:45:45,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {997#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {997#true} {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:45:45,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-07 16:45:45,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 16:45:45,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {997#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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1019#(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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {1019#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {1020#(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[] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {1020#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {1020#(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[] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {1020#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1020#(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] {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:45:45,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:45:45,492 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1002#(<= (+ 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] {998#false} is VALID [2022-04-07 16:45:45,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {997#true} [75] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1017#(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-07 16:45:45,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {1017#(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] {997#true} is VALID [2022-04-07 16:45:45,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {997#true} [80] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {997#true} {997#true} [110] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {997#true} [76] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {997#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] {997#true} is VALID [2022-04-07 16:45:45,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {997#true} [81] L27-->L28: Formula: (let ((.cse0 (mod v_~SIZE~0_4 4294967296))) (and (= |v_main_#t~malloc8.offset_1| 0) (< .cse0 (mod v_~MAX~0_1 4294967296)) (< 1 .cse0) (= (select |v_#valid_2| |v_main_#t~malloc8.base_1|) 0) (= |v_#length_1| (store |v_#length_2| |v_main_#t~malloc8.base_1| (* v_~SIZE~0_4 4))) (= |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] {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:45:45,499 INFO L272 TraceCheckUtils]: 7: Hoare triple {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [83] L28-->#Ultimate.meminitENTRY: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {1018#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-04-07 16:45:45,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#(= |#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] {997#true} is VALID [2022-04-07 16:45:45,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {997#true} [88] #Ultimate.meminitFINAL-->#Ultimate.meminitEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {997#true} is VALID [2022-04-07 16:45:45,500 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {997#true} {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [112] #Ultimate.meminitEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (and (= |v_#Ultimate.meminit_#productInParam_1| (* v_~SIZE~0_14 4)) (= |v_#Ultimate.meminit_#sizeOfFieldsInParam_1| 4) (= v_~SIZE~0_14 |v_#Ultimate.meminit_#amountOfFieldsInParam_1|) (= |v_main_#t~malloc8.offset_4| |v_#Ultimate.meminit_#ptr.offsetInParam_1|) (= |v_#Ultimate.meminit_#ptr.baseInParam_1| |v_main_#t~malloc8.base_4|)) 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] {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:45:45,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} [85] L28-1-->L30: Formula: (and (= (store |v_#memory_int_5| v_main_~a~0.base_1 (store (select |v_#memory_int_5| v_main_~a~0.base_1) (+ v_main_~a~0.offset_1 (* (let ((.cse0 (mod (div (mod v_~SIZE~0_6 4294967296) 2) 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4)) 3)) |v_#memory_int_4|) (= |v_main_#t~malloc8.offset_3| v_main_~a~0.offset_1) (= v_main_~a~0.base_1 |v_main_#t~malloc8.base_3|)) 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] {1002#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID [2022-04-07 16:45:45,501 INFO L272 TraceCheckUtils]: 12: Hoare triple {1002#(<= (+ 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] {997#true} is VALID [2022-04-07 16:45:45,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {997#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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {1019#(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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} [98] L17-1-->L17-3: Formula: (and (= |v_linear_search_#t~mem4_3| (select (select |v_#memory_int_1| v_linear_search_~a.base_2) (+ (* (let ((.cse0 (mod v_linear_search_~j~0_8 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 4) v_linear_search_~a.offset_2))) (let ((.cse1 (= |v_linear_search_#t~mem4_3| v_linear_search_~q_2))) (or (and (not .cse1) |v_linear_search_#t~short5_6|) (and .cse1 (not |v_linear_search_#t~short5_6|)))) |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] {1019#(and (<= linear_search_~j~0 0) (<= 0 linear_search_~j~0))} is VALID [2022-04-07 16:45:45,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {1019#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {1020#(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[] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {1020#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {1020#(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[] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1020#(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] {1020#(and (<= linear_search_~j~0 1) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID [2022-04-07 16:45:45,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {1020#(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] {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:45:45,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} [102] linear_searchFINAL-->linear_searchEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} is VALID [2022-04-07 16:45:45,507 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1021#(<= ~SIZE~0 (+ (* (div ~SIZE~0 4294967296) 4294967296) 1))} {1002#(<= (+ 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] {998#false} is VALID [2022-04-07 16:45:45,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {998#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[] {998#false} is VALID [2022-04-07 16:45:45,508 INFO L272 TraceCheckUtils]: 25: Hoare triple {998#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] {998#false} is VALID [2022-04-07 16:45:45,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {998#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] {998#false} is VALID [2022-04-07 16:45:45,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {998#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[] {998#false} is VALID [2022-04-07 16:45:45,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {998#false} [105] L8-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {998#false} is VALID [2022-04-07 16:45:45,509 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-07 16:45:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 16:45:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570348638] [2022-04-07 16:45:45,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570348638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 16:45:45,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2543850] [2022-04-07 16:45:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 16:45:45,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 16:45:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 16:45:45,512 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-07 16:45:45,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process