/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:07:10,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:07:10,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:07:10,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:07:10,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:07:10,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:07:10,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:07:10,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:07:10,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:07:10,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:07:10,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:07:10,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:07:10,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:07:10,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:07:10,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:07:10,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:07:10,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:07:10,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:07:10,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:07:10,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:07:10,448 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:07:10,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:07:10,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:07:10,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:07:10,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:07:10,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:07:10,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:07:10,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:07:10,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:07:10,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:07:10,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:07:10,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:07:10,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:07:10,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:07:10,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:07:10,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:07:10,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:07:10,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:07:10,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:07:10,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:07:10,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:07:10,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:07:10,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:07:10,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:07:10,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:07:10,484 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:07:10,484 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:07:10,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:07:10,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:07:10,485 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:07:10,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:07:10,485 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:07:10,485 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:07:10,486 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:07:10,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:10,487 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:07:10,487 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:07:10,488 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:07:10,488 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:07:10,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:07:10,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:07:10,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:07:10,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:07:10,715 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:07:10,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-15 00:07:10,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72797c6d6/87a3441ff4114cedb156140ce455b11f/FLAG7edee3861 [2022-04-15 00:07:11,057 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:07:11,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_NetBSD-libc_loop.i [2022-04-15 00:07:11,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72797c6d6/87a3441ff4114cedb156140ce455b11f/FLAG7edee3861 [2022-04-15 00:07:11,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72797c6d6/87a3441ff4114cedb156140ce455b11f [2022-04-15 00:07:11,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:07:11,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:07:11,489 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:11,489 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:07:11,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:07:11,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48a18c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11, skipping insertion in model container [2022-04-15 00:07:11,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:07:11,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:07:11,621 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/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-15 00:07:11,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:11,685 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:07:11,699 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/veris.c_NetBSD-libc_loop.i[825,838] [2022-04-15 00:07:11,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:07:11,718 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:07:11,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11 WrapperNode [2022-04-15 00:07:11,720 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:07:11,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:07:11,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:07:11,721 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:07:11,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:07:11,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:07:11,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:07:11,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:07:11,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:07:11,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:11,782 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:07:11,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:07:11,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:07:11,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:07:11,812 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:07:11,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:07:11,812 INFO L138 BoogieDeclarations]: Found implementation of procedure glob2 [2022-04-15 00:07:11,813 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:07:11,813 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:07:11,814 INFO L130 BoogieDeclarations]: Found specification of procedure glob2 [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:07:11,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:07:11,864 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:07:11,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:07:11,990 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:07:11,995 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:07:11,996 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 00:07:11,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:11 BoogieIcfgContainer [2022-04-15 00:07:11,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:07:11,997 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:07:11,997 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:07:11,998 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:07:12,000 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:11" (1/1) ... [2022-04-15 00:07:12,003 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:07:12,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:12 BasicIcfg [2022-04-15 00:07:12,062 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:07:12,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:07:12,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:07:12,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:07:12,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:07:11" (1/4) ... [2022-04-15 00:07:12,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236e17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:12, skipping insertion in model container [2022-04-15 00:07:12,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:07:11" (2/4) ... [2022-04-15 00:07:12,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236e17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:07:12, skipping insertion in model container [2022-04-15 00:07:12,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:07:11" (3/4) ... [2022-04-15 00:07:12,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4236e17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:12, skipping insertion in model container [2022-04-15 00:07:12,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:07:12" (4/4) ... [2022-04-15 00:07:12,068 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc_loop.iqvasr [2022-04-15 00:07:12,071 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:07:12,071 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:07:12,117 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:07:12,121 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:07:12,122 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:07:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:12,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 00:07:12,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:12,153 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:12,154 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:12,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash 612194795, now seen corresponding path program 1 times [2022-04-15 00:07:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:12,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789106645] [2022-04-15 00:07:12,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:12,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:12,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:12,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {29#true} is VALID [2022-04-15 00:07:12,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:12,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:12,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:12,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {29#true} is VALID [2022-04-15 00:07:12,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:12,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:12,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#true} is VALID [2022-04-15 00:07:12,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:12,495 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:12,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:12,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:12,499 INFO L272 TraceCheckUtils]: 9: Hoare triple {36#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:12,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: 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#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:12,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} [72] L15-->L16: 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[] {30#false} is VALID [2022-04-15 00:07:12,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {30#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30#false} is VALID [2022-04-15 00:07:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:12,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:12,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789106645] [2022-04-15 00:07:12,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789106645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:07:12,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:07:12,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:07:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955221954] [2022-04-15 00:07:12,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:07:12,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:12,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:12,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:12,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:12,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:07:12,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:07:12,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:07:12,553 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:12,968 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-15 00:07:12,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:07:12,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 00:07:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:12,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:07:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:07:12,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 00:07:13,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:13,051 INFO L225 Difference]: With dead ends: 55 [2022-04-15 00:07:13,051 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 00:07:13,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 00:07:13,055 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 42 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:13,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 57 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:07:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 00:07:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-04-15 00:07:13,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:13,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:13,081 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:13,081 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:13,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:13,083 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 00:07:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 00:07:13,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:13,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:13,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:07:13,084 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-15 00:07:13,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:13,086 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 00:07:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 00:07:13,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:13,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:13,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:13,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 00:07:13,089 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 13 [2022-04-15 00:07:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:13,089 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 00:07:13,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 00:07:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 00:07:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 00:07:13,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:13,090 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:13,090 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:07:13,091 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:13,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1895818048, now seen corresponding path program 1 times [2022-04-15 00:07:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:13,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603296468] [2022-04-15 00:07:13,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:13,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:13,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:13,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:13,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:07:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:13,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: 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] {210#true} is VALID [2022-04-15 00:07:13,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:13,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:13,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,223 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:13,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: 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] {210#true} is VALID [2022-04-15 00:07:13,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,224 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:13,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: 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] {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:13,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} [72] L15-->L16: 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[] {211#false} is VALID [2022-04-15 00:07:13,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:13,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:13,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603296468] [2022-04-15 00:07:13,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603296468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:13,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964959932] [2022-04-15 00:07:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:13,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:13,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:13,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:07:13,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 00:07:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:13,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 00:07:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:13,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:07:13,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:13,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,643 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:13,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: 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] {210#true} is VALID [2022-04-15 00:07:13,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,645 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,648 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:13,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: 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] {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:13,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: 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[] {211#false} is VALID [2022-04-15 00:07:13,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:13,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:07:13,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {211#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {211#false} is VALID [2022-04-15 00:07:13,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {284#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: 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[] {211#false} is VALID [2022-04-15 00:07:13,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {280#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: 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] {284#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:13,968 INFO L272 TraceCheckUtils]: 17: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {280#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:13,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {222#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,971 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {210#true} {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {210#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {210#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {210#true} [70] __VERIFIER_assertENTRY-->L15: 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] {210#true} is VALID [2022-04-15 00:07:13,972 INFO L272 TraceCheckUtils]: 9: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {210#true} is VALID [2022-04-15 00:07:13,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {217#(and (<= (+ 4 glob2_~p~0.offset) ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:13,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {216#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {210#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {215#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset))} is VALID [2022-04-15 00:07:13,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {210#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {210#true} {210#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {210#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {210#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {210#true} is VALID [2022-04-15 00:07:13,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {210#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {210#true} is VALID [2022-04-15 00:07:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:07:13,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964959932] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:07:13,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:07:13,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-15 00:07:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366543641] [2022-04-15 00:07:13,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:07:13,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 00:07:13,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:13,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:13,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:13,995 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 00:07:13,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:13,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 00:07:13,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-15 00:07:13,996 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:14,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:14,345 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 00:07:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:07:14,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-15 00:07:14,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 00:07:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2022-04-15 00:07:14,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2022-04-15 00:07:14,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:14,408 INFO L225 Difference]: With dead ends: 36 [2022-04-15 00:07:14,408 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 00:07:14,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-04-15 00:07:14,410 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:14,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:07:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 00:07:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 00:07:14,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:14,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:14,422 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:14,422 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:14,424 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 00:07:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 00:07:14,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:14,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:14,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 00:07:14,425 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 00:07:14,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:14,426 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 00:07:14,426 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 00:07:14,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:14,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:14,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:14,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 00:07:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 00:07:14,428 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 21 [2022-04-15 00:07:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:14,428 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 00:07:14,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 00:07:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 00:07:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:07:14,429 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:07:14,429 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:07:14,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 00:07:14,644 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:14,645 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:07:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:07:14,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1869530475, now seen corresponding path program 2 times [2022-04-15 00:07:14,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:07:14,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819370529] [2022-04-15 00:07:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:07:14,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:07:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:07:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:14,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {532#true} is VALID [2022-04-15 00:07:14,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {532#true} {532#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-15 00:07:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:14,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:14,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 00:07:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:14,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:14,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:07:14,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {551#(and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {532#true} is VALID [2022-04-15 00:07:14,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {537#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:14,824 INFO L272 TraceCheckUtils]: 6: Hoare triple {537#(and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {538#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-15 00:07:14,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#(and (= ~tmp~0.base |glob2_#in~pathbuf.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,825 INFO L272 TraceCheckUtils]: 9: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:14,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:14,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,826 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,828 INFO L272 TraceCheckUtils]: 17: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:14,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:14,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:14,829 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} is VALID [2022-04-15 00:07:14,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {539#(and (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:14,831 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {549#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:07:14,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {549#(not (= |__VERIFIER_assert_#in~cond| 0))} [70] __VERIFIER_assertENTRY-->L15: 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] {550#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:07:14,831 INFO L290 TraceCheckUtils]: 27: Hoare triple {550#(not (= __VERIFIER_assert_~cond 0))} [72] L15-->L16: 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[] {533#false} is VALID [2022-04-15 00:07:14,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 00:07:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 00:07:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:07:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819370529] [2022-04-15 00:07:14,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819370529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 00:07:14,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036221763] [2022-04-15 00:07:14,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 00:07:14,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 00:07:14,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:07:14,833 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 00:07:14,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 00:07:14,880 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 00:07:14,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 00:07:14,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 00:07:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:07:14,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 00:07:15,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {532#true} is VALID [2022-04-15 00:07:15,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-15 00:07:15,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,139 INFO L272 TraceCheckUtils]: 9: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:15,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:15,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,140 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:15,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:15,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,144 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,146 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:15,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: 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] {637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:15,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: 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[] {533#false} is VALID [2022-04-15 00:07:15,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 00:07:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 00:07:15,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 00:07:15,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {533#false} [74] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {533#false} is VALID [2022-04-15 00:07:15,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#(<= 1 __VERIFIER_assert_~cond)} [72] L15-->L16: 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[] {533#false} is VALID [2022-04-15 00:07:15,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {633#(<= 1 |__VERIFIER_assert_#in~cond|)} [70] __VERIFIER_assertENTRY-->L15: 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] {637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 00:07:15,512 INFO L272 TraceCheckUtils]: 25: Hoare triple {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 00:07:15,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {548#(and (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,514 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:15,514 INFO L272 TraceCheckUtils]: 17: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:15,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [71] L29-2-->L29-3: Formula: (and (= (+ 4 v_glob2_~p~0.offset_4) v_glob2_~p~0.offset_3) (= v_glob2_~p~0.base_4 v_glob2_~p~0.base_3)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_4, glob2_~p~0.offset=v_glob2_~p~0.offset_4} OutVars{glob2_#t~post1.offset=|v_glob2_#t~post1.offset_1|, glob2_~p~0.base=v_glob2_~p~0.base_3, glob2_#t~post1.base=|v_glob2_#t~post1.base_1|, glob2_~p~0.offset=v_glob2_~p~0.offset_3} AuxVars[] AssignedVars[glob2_#t~post1.offset, glob2_~p~0.base, glob2_#t~post1.base, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [69] L31-1-->L29-2: Formula: (= (store |v_#memory_int_2| v_glob2_~p~0.base_2 (store (select |v_#memory_int_2| v_glob2_~p~0.base_2) v_glob2_~p~0.offset_2 1)) |v_#memory_int_1|) InVars {#memory_int=|v_#memory_int_2|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} OutVars{#memory_int=|v_#memory_int_1|, glob2_~p~0.base=v_glob2_~p~0.base_2, glob2_~p~0.offset=v_glob2_~p~0.offset_2} AuxVars[] AssignedVars[#memory_int] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,518 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {532#true} {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [80] __VERIFIER_assertEXIT-->L31-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,518 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#true} [76] L15-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#true} [73] L15-->L15-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#true} [70] __VERIFIER_assertENTRY-->L15: 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] {532#true} is VALID [2022-04-15 00:07:15,518 INFO L272 TraceCheckUtils]: 9: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [67] L31-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (and (= v_glob2_~p~0.base_9 v_~tmp~0.base_8) (<= v_glob2_~p~0.offset_9 v_~tmp~0.offset_8)) 1 0)) InVars {glob2_~p~0.base=v_glob2_~p~0.base_9, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8, glob2_~p~0.offset=v_glob2_~p~0.offset_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|, ~tmp~0.base=v_~tmp~0.base_8, ~tmp~0.offset=v_~tmp~0.offset_8} AuxVars[] AssignedVars[glob2_~p~0.base, __VERIFIER_assert_#in~cond, glob2_~p~0.offset] {532#true} is VALID [2022-04-15 00:07:15,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} [65] L29-3-->L31: Formula: (and (<= v_glob2_~p~0.offset_8 v_glob2_~pathlim.offset_3) (= v_glob2_~p~0.base_8 v_glob2_~pathlim.base_3)) InVars {glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_3, glob2_~p~0.base=v_glob2_~p~0.base_8, glob2_~pathlim.offset=v_glob2_~pathlim.offset_3, glob2_~p~0.offset=v_glob2_~p~0.offset_8} AuxVars[] AssignedVars[] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} [61] glob2ENTRY-->L29-3: Formula: (and (= v_glob2_~pathlim.offset_1 |v_glob2_#in~pathlim.offset_1|) (= v_glob2_~pathbuf.offset_1 v_glob2_~p~0.offset_5) (= v_glob2_~pathbuf.base_1 |v_glob2_#in~pathbuf.base_1|) (= v_glob2_~pathbuf.offset_1 |v_glob2_#in~pathbuf.offset_1|) (= |v_glob2_#in~pathlim.base_1| v_glob2_~pathlim.base_1) (= v_glob2_~p~0.base_5 v_glob2_~pathbuf.base_1)) InVars {glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} OutVars{glob2_~pathlim.base=v_glob2_~pathlim.base_1, glob2_~p~0.base=v_glob2_~p~0.base_5, glob2_~pathlim.offset=v_glob2_~pathlim.offset_1, glob2_~p~0.offset=v_glob2_~p~0.offset_5, glob2_~pathbuf.base=v_glob2_~pathbuf.base_1, glob2_~pathbuf.offset=v_glob2_~pathbuf.offset_1, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offset_1|, glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.base_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offset_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.base_1|} AuxVars[] AssignedVars[glob2_~pathlim.base, glob2_~p~0.base, glob2_~pathlim.offset, glob2_~p~0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset] {578#(and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} [59] L46-->glob2ENTRY: Formula: (and (= |v_glob2_#in~pathbuf.offsetInParam_1| |v_main_~#pathbuf~0.offset_5|) (= v_main_~bound~0.base_3 |v_glob2_#in~pathlim.baseInParam_1|) (= |v_main_~#pathbuf~0.base_5| |v_glob2_#in~pathbuf.baseInParam_1|) (= |v_glob2_#in~pathlim.offsetInParam_1| v_main_~bound~0.offset_3)) InVars {main_~bound~0.offset=v_main_~bound~0.offset_3, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_5|, main_~bound~0.base=v_main_~bound~0.base_3, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_5|} OutVars{glob2_#in~pathbuf.base=|v_glob2_#in~pathbuf.baseInParam_1|, glob2_#in~pathlim.offset=|v_glob2_#in~pathlim.offsetInParam_1|, glob2_#in~pathbuf.offset=|v_glob2_#in~pathbuf.offsetInParam_1|, glob2_#in~pathlim.base=|v_glob2_#in~pathlim.baseInParam_1|} AuxVars[] AssignedVars[main_~#pathbuf~0.base, glob2_#in~pathbuf.base, glob2_#in~pathlim.offset, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base] {574#(and (= ~tmp~0.base |glob2_#in~pathlim.base|) (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))} is VALID [2022-04-15 00:07:15,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {532#true} [57] mainENTRY-->L46: Formula: (let ((.cse0 (+ |v_main_~#pathbuf~0.offset_1| 4))) (and (< |v_#StackHeapBarrier_1| |v_main_~#pathbuf~0.base_1|) (= |v_#length_1| (store |v_#length_2| |v_main_~#pathbuf~0.base_1| 8)) (= |v_main_~#pathbuf~0.base_1| v_main_~bound~0.base_1) (= .cse0 v_main_~bound~0.offset_1) (= |v_main_~#pathbuf~0.base_1| v_~tmp~0.base_2) (not (= |v_main_~#pathbuf~0.base_1| 0)) (= |v_main_~#pathbuf~0.offset_1| 0) (= (select |v_#valid_2| |v_main_~#pathbuf~0.base_1|) 0) (= |v_#valid_1| (store |v_#valid_2| |v_main_~#pathbuf~0.base_1| 1)) (= .cse0 v_~tmp~0.offset_2))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ~tmp~0.offset=v_~tmp~0.offset_2, main_~#pathbuf~0.base=|v_main_~#pathbuf~0.base_1|, #valid=|v_#valid_1|, ~tmp~0.base=v_~tmp~0.base_2, #length=|v_#length_1|, main_~bound~0.offset=v_main_~bound~0.offset_1, main_~#pathbuf~0.offset=|v_main_~#pathbuf~0.offset_1|, main_~bound~0.base=v_main_~bound~0.base_1} AuxVars[] AssignedVars[~tmp~0.offset, main_~#pathbuf~0.base, #valid, ~tmp~0.base, #length, main_~bound~0.offset, main_~#pathbuf~0.offset, main_~bound~0.base] {570#(and (<= main_~bound~0.offset ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base))} is VALID [2022-04-15 00:07:15,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {532#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {532#true} {532#true} [77] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {532#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {532#true} [55] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_5| 1))) (and (= (select .cse0 0) 48) (= (select |v_#valid_5| 1) 1) (= 2 (select |v_#length_3| 1)) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#length_3| 2) 27) (= |v_#NULL.base_1| 0) (= (select |v_#valid_5| 2) 1) (= v_~tmp~0.base_3 0) (= (select .cse0 1) 0) (= v_~tmp~0.offset_3 0) (= (select |v_#valid_5| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_5|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ~tmp~0.offset=v_~tmp~0.offset_3, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_5|, #NULL.offset=|v_#NULL.offset_1|, ~tmp~0.base=v_~tmp~0.base_3, #length=|v_#length_3|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[~tmp~0.offset, #NULL.offset, ~tmp~0.base, #NULL.base] {532#true} is VALID [2022-04-15 00:07:15,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {532#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {532#true} is VALID [2022-04-15 00:07:15,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 00:07:15,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036221763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 00:07:15,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 00:07:15,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-04-15 00:07:15,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045216407] [2022-04-15 00:07:15,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 00:07:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-15 00:07:15,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:07:15,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:15,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:15,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 00:07:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:07:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 00:07:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:07:15,553 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:15,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:15,854 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 00:07:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:07:15,854 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-15 00:07:15,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:07:15,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2022-04-15 00:07:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 18 transitions. [2022-04-15 00:07:15,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 18 transitions. [2022-04-15 00:07:15,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:07:15,872 INFO L225 Difference]: With dead ends: 32 [2022-04-15 00:07:15,872 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:07:15,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2022-04-15 00:07:15,873 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 00:07:15,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 59 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 00:07:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:07:15,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:07:15,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:07:15,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:15,874 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:15,874 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:15,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:07:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:15,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:15,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:15,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:07:15,875 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:07:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:07:15,875 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:07:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:15,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:15,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:07:15,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:07:15,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:07:15,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:07:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:07:15,876 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-15 00:07:15,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:07:15,876 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:07:15,876 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 6 states have call successors, (9), 6 states have call predecessors, (9), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 00:07:15,876 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:07:15,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:07:15,878 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:07:15,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 00:07:16,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 00:07:16,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:07:16,202 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L885 garLoopResultBuilder]: At program point glob2ENTRY(lines 25 36) the Hoare annotation is: true [2022-04-15 00:07:16,203 INFO L878 garLoopResultBuilder]: At program point L29-3(lines 29 33) the Hoare annotation is: (or (and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))) [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point L29-4(lines 29 33) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= glob2_~pathlim.base ~tmp~0.base) (<= glob2_~pathlim.offset ~tmp~0.offset) (= ~tmp~0.base glob2_~p~0.base) (<= glob2_~p~0.offset ~tmp~0.offset)) (not (= ~tmp~0.base |glob2_#in~pathbuf.base|)) (not (= ~tmp~0.base |glob2_#in~pathlim.base|)) (not (<= (+ |glob2_#in~pathbuf.offset| 4) ~tmp~0.offset)) (not (<= |glob2_#in~pathlim.offset| ~tmp~0.offset))) [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point glob2FINAL(lines 25 36) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point L31-1(line 31) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point glob2EXIT(lines 25 36) no Hoare annotation was computed. [2022-04-15 00:07:16,203 INFO L882 garLoopResultBuilder]: For program point L29-2(lines 29 33) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:07:16,204 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 38 49) the Hoare annotation is: (and (= ~tmp~0.offset |old(~tmp~0.offset)|) (= |old(~tmp~0.base)| ~tmp~0.base)) [2022-04-15 00:07:16,204 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (= ~tmp~0.base |main_~#pathbuf~0.base|) (<= main_~bound~0.offset ~tmp~0.offset) (<= (+ 4 |main_~#pathbuf~0.offset|) ~tmp~0.offset) (= ~tmp~0.base main_~bound~0.base)) [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 38 49) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 38 49) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-15 00:07:16,204 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-15 00:07:16,205 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-15 00:07:16,205 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-15 00:07:16,207 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1] [2022-04-15 00:07:16,208 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:07:16,211 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:07:16,212 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:07:16,212 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:07:16,212 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 00:07:16,212 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 00:07:16,213 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: glob2FINAL has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: glob2EXIT has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:07:16,214 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:07:16,214 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:07:16,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:07:16 BasicIcfg [2022-04-15 00:07:16,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:07:16,224 INFO L158 Benchmark]: Toolchain (without parser) took 4736.92ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 163.5MB in the beginning and 157.5MB in the end (delta: 6.1MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,225 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 222.3MB. Free memory is still 179.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:07:16,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.32ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 163.4MB in the beginning and 305.1MB in the end (delta: -141.7MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,225 INFO L158 Benchmark]: Boogie Preprocessor took 36.90ms. Allocated memory is still 334.5MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,226 INFO L158 Benchmark]: RCFGBuilder took 238.61ms. Allocated memory is still 334.5MB. Free memory was 303.0MB in the beginning and 289.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,226 INFO L158 Benchmark]: IcfgTransformer took 65.10ms. Allocated memory is still 334.5MB. Free memory was 289.9MB in the beginning and 288.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,228 INFO L158 Benchmark]: TraceAbstraction took 4159.11ms. Allocated memory is still 334.5MB. Free memory was 287.8MB in the beginning and 157.5MB in the end (delta: 130.3MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. [2022-04-15 00:07:16,231 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 222.3MB. Free memory is still 179.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.32ms. Allocated memory was 222.3MB in the beginning and 334.5MB in the end (delta: 112.2MB). Free memory was 163.4MB in the beginning and 305.1MB in the end (delta: -141.7MB). Peak memory consumption was 11.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.90ms. Allocated memory is still 334.5MB. Free memory was 305.1MB in the beginning and 303.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 238.61ms. Allocated memory is still 334.5MB. Free memory was 303.0MB in the beginning and 289.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 65.10ms. Allocated memory is still 334.5MB. Free memory was 289.9MB in the beginning and 288.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 4159.11ms. Allocated memory is still 334.5MB. Free memory was 287.8MB in the beginning and 157.5MB in the end (delta: 130.3MB). Peak memory consumption was 131.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 36 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=2, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 17 NumberOfFragments, 100 HoareAnnotationTreeSize, 12 FomulaSimplifications, 7 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 146 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 113 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 16 NumberOfNonLiveVariables, 246 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 48/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((pathlim == tmp && pathlim <= tmp) && tmp == p) || !(tmp == pathbuf)) || !(tmp == pathlim)) || !(pathbuf + 4 <= tmp)) || !(pathlim <= tmp) RESULT: Ultimate proved your program to be correct! [2022-04-15 00:07:16,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...