/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/loop-invgen/MADWiFi-encode_ie_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:33:48,569 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:33:48,570 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:33:48,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:33:48,596 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:33:48,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:33:48,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:33:48,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:33:48,599 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:33:48,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:33:48,601 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:33:48,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:33:48,601 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:33:48,602 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:33:48,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:33:48,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:33:48,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:33:48,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:33:48,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:33:48,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:33:48,619 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:33:48,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:33:48,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:33:48,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:33:48,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:33:48,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:33:48,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:33:48,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:33:48,625 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:33:48,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:33:48,626 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:33:48,626 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:33:48,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:33:48,627 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:33:48,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:33:48,628 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:33:48,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:33:48,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:33:48,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:33:48,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:33:48,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:33:48,633 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:33:48,634 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:33:48,657 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:33:48,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:33:48,658 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:33:48,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:33:48,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:33:48,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:33:48,659 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:33:48,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:33:48,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:33:48,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:33:48,659 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:33:48,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:33:48,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:33:48,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:33:48,661 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:33:48,662 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:33:48,662 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-27 21:33:48,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:33:48,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:33:48,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:33:48,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:33:48,814 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:33:48,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-27 21:33:48,858 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6611632/19f858cb74714a04bb0bddb717c95e24/FLAG8f9e65a45 [2022-04-27 21:33:49,145 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:33:49,146 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i [2022-04-27 21:33:49,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6611632/19f858cb74714a04bb0bddb717c95e24/FLAG8f9e65a45 [2022-04-27 21:33:49,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb6611632/19f858cb74714a04bb0bddb717c95e24 [2022-04-27 21:33:49,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:33:49,575 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:33:49,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:33:49,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:33:49,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:33:49,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6782fecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49, skipping insertion in model container [2022-04-27 21:33:49,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:33:49,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:33:49,721 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-04-27 21:33:49,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:33:49,753 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:33:49,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/MADWiFi-encode_ie_ok.i[893,906] [2022-04-27 21:33:49,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:33:49,774 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:33:49,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49 WrapperNode [2022-04-27 21:33:49,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:33:49,776 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:33:49,776 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:33:49,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:33:49,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:33:49,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:33:49,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:33:49,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:33:49,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (1/1) ... [2022-04-27 21:33:49,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:33:49,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:49,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:33:49,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:33:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:33:49,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 21:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:33:49,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:33:49,850 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:33:49,851 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:33:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 21:33:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 21:33:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:33:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:33:49,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:33:49,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:33:49,911 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:33:49,912 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:33:50,048 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:33:50,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:33:50,056 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:33:50,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:50 BoogieIcfgContainer [2022-04-27 21:33:50,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:33:50,058 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:33:50,058 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:33:50,059 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:33:50,061 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:50" (1/1) ... [2022-04-27 21:33:50,062 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:33:50,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:33:50 BasicIcfg [2022-04-27 21:33:50,109 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:33:50,110 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:33:50,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:33:50,112 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:33:50,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:33:49" (1/4) ... [2022-04-27 21:33:50,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55fa07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:33:50, skipping insertion in model container [2022-04-27 21:33:50,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:33:49" (2/4) ... [2022-04-27 21:33:50,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55fa07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:33:50, skipping insertion in model container [2022-04-27 21:33:50,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:33:50" (3/4) ... [2022-04-27 21:33:50,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f55fa07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:33:50, skipping insertion in model container [2022-04-27 21:33:50,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:33:50" (4/4) ... [2022-04-27 21:33:50,117 INFO L111 eAbstractionObserver]: Analyzing ICFG MADWiFi-encode_ie_ok.iqvasr [2022-04-27 21:33:50,125 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:33:50,126 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:33:50,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:33:50,157 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b071b32, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d28d48 [2022-04-27 21:33:50,157 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:33:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 21:33:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:33:50,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:50,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:50,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1231819666, now seen corresponding path program 1 times [2022-04-27 21:33:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:50,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911304136] [2022-04-27 21:33:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:50,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 21:33:50,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:33:50,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {32#true} is VALID [2022-04-27 21:33:50,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {32#true} is VALID [2022-04-27 21:33:50,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {32#true} is VALID [2022-04-27 21:33:50,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-27 21:33:50,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= 1 main_~leader_len~0)} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-27 21:33:50,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= 1 main_~leader_len~0)} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {37#(<= 1 main_~leader_len~0)} is VALID [2022-04-27 21:33:50,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= 1 main_~leader_len~0)} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {38#(<= 1 main_~p~0)} is VALID [2022-04-27 21:33:50,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(<= 1 main_~p~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {38#(<= 1 main_~p~0)} is VALID [2022-04-27 21:33:50,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#(<= 1 main_~p~0)} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {38#(<= 1 main_~p~0)} is VALID [2022-04-27 21:33:50,401 INFO L272 TraceCheckUtils]: 15: Hoare triple {38#(<= 1 main_~p~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {39#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:33:50,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#(not (= |__VERIFIER_assert_#in~cond| 0))} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {40#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:33:50,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#(not (= __VERIFIER_assert_~cond 0))} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 21:33:50,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#false} is VALID [2022-04-27 21:33:50,404 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-27 21:33:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:50,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911304136] [2022-04-27 21:33:50,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911304136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:33:50,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:33:50,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:33:50,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373178976] [2022-04-27 21:33:50,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:33:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:33:50,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:50,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:33:50,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:50,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:33:50,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:33:50,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:33:50,467 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:33:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:50,830 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2022-04-27 21:33:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:33:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:33:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:33:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-27 21:33:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:33:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-27 21:33:50,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-27 21:33:50,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:50,912 INFO L225 Difference]: With dead ends: 52 [2022-04-27 21:33:50,912 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 21:33:50,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:33:50,917 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:50,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:33:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 21:33:50,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 21:33:50,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:50,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:33:50,948 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:33:50,949 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:33:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:50,951 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-27 21:33:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-27 21:33:50,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:50,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:50,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 21:33:50,952 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 21:33:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:50,953 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-27 21:33:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-27 21:33:50,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:50,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:50,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:50,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:33:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-27 21:33:50,956 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2022-04-27 21:33:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:50,957 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-27 21:33:50,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:33:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-27 21:33:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 21:33:50,958 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:50,958 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:50,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:33:50,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:50,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1598286936, now seen corresponding path program 1 times [2022-04-27 21:33:50,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:50,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655056529] [2022-04-27 21:33:50,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:50,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {219#true} is VALID [2022-04-27 21:33:51,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 21:33:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {219#true} is VALID [2022-04-27 21:33:51,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} [128] L18-->L18-2: Formula: (not (= 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[] {219#true} is VALID [2022-04-27 21:33:51,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:33:51,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {219#true} is VALID [2022-04-27 21:33:51,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {219#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {219#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {219#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {219#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {219#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {224#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {224#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {224#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,037 INFO L272 TraceCheckUtils]: 15: Hoare triple {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {219#true} is VALID [2022-04-27 21:33:51,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {219#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {219#true} is VALID [2022-04-27 21:33:51,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {219#true} [128] L18-->L18-2: Formula: (not (= 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[] {219#true} is VALID [2022-04-27 21:33:51,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#true} is VALID [2022-04-27 21:33:51,039 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {219#true} {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,039 INFO L272 TraceCheckUtils]: 20: Hoare triple {225#(<= (+ main_~p~0 3) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {230#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:33:51,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {230#(not (= |__VERIFIER_assert_#in~cond| 0))} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {231#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:33:51,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {231#(not (= __VERIFIER_assert_~cond 0))} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {220#false} is VALID [2022-04-27 21:33:51,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {220#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {220#false} is VALID [2022-04-27 21:33:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:33:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:51,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655056529] [2022-04-27 21:33:51,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655056529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:33:51,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:33:51,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 21:33:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763910957] [2022-04-27 21:33:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:33:51,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 21:33:51,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:51,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:33:51,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:51,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 21:33:51,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:51,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 21:33:51,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 21:33:51,059 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:33:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:51,296 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-04-27 21:33:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 21:33:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 21:33:51,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:33:51,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 21:33:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:33:51,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-27 21:33:51,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-27 21:33:51,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:51,337 INFO L225 Difference]: With dead ends: 39 [2022-04-27 21:33:51,337 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 21:33:51,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:33:51,340 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:51,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 44 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:33:51,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 21:33:51,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-27 21:33:51,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:51,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:33:51,359 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:33:51,360 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:33:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:51,362 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-27 21:33:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-27 21:33:51,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:51,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:51,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-27 21:33:51,363 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-27 21:33:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:51,364 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-27 21:33:51,364 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-27 21:33:51,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:51,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:51,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:51,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 21:33:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-04-27 21:33:51,366 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 24 [2022-04-27 21:33:51,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:51,367 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-04-27 21:33:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 21:33:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-04-27 21:33:51,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 21:33:51,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:51,368 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:33:51,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:51,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:51,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1081273981, now seen corresponding path program 1 times [2022-04-27 21:33:51,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:51,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886999640] [2022-04-27 21:33:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {420#true} is VALID [2022-04-27 21:33:51,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 21:33:51,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 21:33:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 21:33:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:33:51,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {444#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {420#true} is VALID [2022-04-27 21:33:51,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {425#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {425#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,490 INFO L272 TraceCheckUtils]: 15: Hoare triple {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,491 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {420#true} {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,491 INFO L272 TraceCheckUtils]: 20: Hoare triple {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,492 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {420#true} {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {426#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {435#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:33:51,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {435#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {436#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:51,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {436#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,494 INFO L272 TraceCheckUtils]: 28: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,495 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {420#true} {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,495 INFO L272 TraceCheckUtils]: 33: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {442#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:33:51,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {442#(not (= |__VERIFIER_assert_#in~cond| 0))} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {443#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:33:51,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {443#(not (= __VERIFIER_assert_~cond 0))} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:51,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {421#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 21:33:51,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886999640] [2022-04-27 21:33:51,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886999640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:51,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714402585] [2022-04-27 21:33:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:51,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:51,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:33:51,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:33:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:33:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:51,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:51,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {425#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {425#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,935 INFO L272 TraceCheckUtils]: 15: Hoare triple {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,937 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {420#true} {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,937 INFO L272 TraceCheckUtils]: 20: Hoare triple {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,947 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {420#true} {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:51,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {487#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {524#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} is VALID [2022-04-27 21:33:51,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {524#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {528#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:51,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {528#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,949 INFO L272 TraceCheckUtils]: 28: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:51,949 INFO L290 TraceCheckUtils]: 29: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:51,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:51,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:51,950 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {420#true} {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:51,951 INFO L272 TraceCheckUtils]: 33: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:33:51,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {550#(<= 1 |__VERIFIER_assert_#in~cond|)} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:33:51,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {554#(<= 1 __VERIFIER_assert_~cond)} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:51,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {421#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 21:33:51,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:52,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {421#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:52,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {554#(<= 1 __VERIFIER_assert_~cond)} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {421#false} is VALID [2022-04-27 21:33:52,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {550#(<= 1 |__VERIFIER_assert_#in~cond|)} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {554#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:33:52,395 INFO L272 TraceCheckUtils]: 33: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {550#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:33:52,395 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {420#true} {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:52,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:52,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:52,396 INFO L272 TraceCheckUtils]: 28: Hoare triple {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:52,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {588#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {437#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:52,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {592#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {588#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:52,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {592#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:52,404 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {420#true} {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:52,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:52,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:52,404 INFO L272 TraceCheckUtils]: 20: Hoare triple {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:52,405 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {420#true} {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:52,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {420#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {420#true} [128] L18-->L18-2: Formula: (not (= 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[] {420#true} is VALID [2022-04-27 21:33:52,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {420#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {420#true} is VALID [2022-04-27 21:33:52,405 INFO L272 TraceCheckUtils]: 15: Hoare triple {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {420#true} is VALID [2022-04-27 21:33:52,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:52,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {633#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 2))} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {596#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:52,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {633#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 2))} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {420#true} is VALID [2022-04-27 21:33:52,408 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {420#true} is VALID [2022-04-27 21:33:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 21:33:52,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714402585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:33:52,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:33:52,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-04-27 21:33:52,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775112129] [2022-04-27 21:33:52,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:33:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 37 [2022-04-27 21:33:52,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:52,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 21:33:52,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:52,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 21:33:52,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:52,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 21:33:52,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:33:52,450 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 21:33:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:53,107 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-27 21:33:53,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 21:33:53,107 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 37 [2022-04-27 21:33:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 21:33:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-27 21:33:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 21:33:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-27 21:33:53,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 51 transitions. [2022-04-27 21:33:53,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:53,156 INFO L225 Difference]: With dead ends: 53 [2022-04-27 21:33:53,156 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 21:33:53,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-04-27 21:33:53,157 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:53,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:33:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 21:33:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-27 21:33:53,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:53,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 21:33:53,183 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 21:33:53,183 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 21:33:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:53,185 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-27 21:33:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 21:33:53,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:53,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:53,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 21:33:53,186 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-27 21:33:53,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:53,187 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-27 21:33:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-27 21:33:53,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:53,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:53,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:53,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-27 21:33:53,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-27 21:33:53,190 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 37 [2022-04-27 21:33:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:53,190 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-27 21:33:53,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 16 states have internal predecessors, (35), 5 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-27 21:33:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-27 21:33:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-27 21:33:53,191 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:33:53,191 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:33:53,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 21:33:53,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:53,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:33:53,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:33:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 59588189, now seen corresponding path program 2 times [2022-04-27 21:33:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:33:53,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057782958] [2022-04-27 21:33:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:33:53,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:33:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:33:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {986#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {945#true} is VALID [2022-04-27 21:33:53,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {945#true} {945#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-27 21:33:53,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-27 21:33:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-04-27 21:33:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-04-27 21:33:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-27 21:33:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-27 21:33:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-04-27 21:33:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:53,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {986#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:33:53,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {986#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {945#true} is VALID [2022-04-27 21:33:53,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {945#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {950#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:53,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,577 INFO L290 TraceCheckUtils]: 14: Hoare triple {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,579 INFO L272 TraceCheckUtils]: 15: Hoare triple {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,580 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {945#true} {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,580 INFO L272 TraceCheckUtils]: 20: Hoare triple {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,581 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {945#true} {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:53,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {951#(and (= main_~i~0 0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {960#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} is VALID [2022-04-27 21:33:53,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {960#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (= main_~i~0 0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,582 INFO L272 TraceCheckUtils]: 28: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,583 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,583 INFO L272 TraceCheckUtils]: 33: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,584 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {970#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,585 INFO L290 TraceCheckUtils]: 39: Hoare triple {970#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,586 INFO L272 TraceCheckUtils]: 41: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,586 INFO L290 TraceCheckUtils]: 42: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,586 INFO L290 TraceCheckUtils]: 43: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,586 INFO L290 TraceCheckUtils]: 44: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,587 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,587 INFO L272 TraceCheckUtils]: 46: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,587 INFO L290 TraceCheckUtils]: 47: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,587 INFO L290 TraceCheckUtils]: 48: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,587 INFO L290 TraceCheckUtils]: 49: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,588 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {945#true} {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {970#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,588 INFO L290 TraceCheckUtils]: 52: Hoare triple {970#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2 (* main_~i~0 2)))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} is VALID [2022-04-27 21:33:53,589 INFO L290 TraceCheckUtils]: 53: Hoare triple {961#(<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:53,589 INFO L272 TraceCheckUtils]: 54: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:53,589 INFO L290 TraceCheckUtils]: 55: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:53,589 INFO L290 TraceCheckUtils]: 56: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:53,589 INFO L290 TraceCheckUtils]: 57: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:53,590 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {945#true} {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:53,590 INFO L272 TraceCheckUtils]: 59: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {984#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 21:33:53,591 INFO L290 TraceCheckUtils]: 60: Hoare triple {984#(not (= |__VERIFIER_assert_#in~cond| 0))} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {985#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:33:53,591 INFO L290 TraceCheckUtils]: 61: Hoare triple {985#(not (= __VERIFIER_assert_~cond 0))} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:53,591 INFO L290 TraceCheckUtils]: 62: Hoare triple {946#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-27 21:33:53,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:33:53,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057782958] [2022-04-27 21:33:53,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057782958] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:33:53,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122625648] [2022-04-27 21:33:53,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:33:53,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:33:53,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:33:53,593 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:33:53,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:33:53,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:33:53,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:33:53,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 21:33:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:33:53,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:33:54,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {945#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {950#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:54,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#(<= (+ main_~bufsize~0 main_~p~0) main_~bufsize_0~0)} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,157 INFO L272 TraceCheckUtils]: 15: Hoare triple {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,158 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {945#true} {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,158 INFO L272 TraceCheckUtils]: 20: Hoare triple {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,159 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {945#true} {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {1029#(and (<= 0 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) main_~bufsize_0~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1066#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} is VALID [2022-04-27 21:33:54,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {1066#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 0 main_~i~0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:54,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:54,161 INFO L272 TraceCheckUtils]: 28: Hoare triple {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,163 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {945#true} {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:54,163 INFO L272 TraceCheckUtils]: 33: Hoare triple {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,163 INFO L290 TraceCheckUtils]: 34: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,165 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {945#true} {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:54,166 INFO L290 TraceCheckUtils]: 38: Hoare triple {1070#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 2)) (<= 1 main_~i~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1107#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)) (<= 1 main_~i~0))} is VALID [2022-04-27 21:33:54,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {1107#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)) (<= 1 main_~i~0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} is VALID [2022-04-27 21:33:54,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} is VALID [2022-04-27 21:33:54,167 INFO L272 TraceCheckUtils]: 41: Hoare triple {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,167 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {945#true} {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} is VALID [2022-04-27 21:33:54,168 INFO L272 TraceCheckUtils]: 46: Hoare triple {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,168 INFO L290 TraceCheckUtils]: 49: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,168 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {945#true} {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} is VALID [2022-04-27 21:33:54,169 INFO L290 TraceCheckUtils]: 51: Hoare triple {1111#(and (<= 2 main_~i~0) (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 4)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1148#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 6)) (<= 2 main_~i~0))} is VALID [2022-04-27 21:33:54,169 INFO L290 TraceCheckUtils]: 52: Hoare triple {1148#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 6)) (<= 2 main_~i~0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1152#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 6)) (<= 3 main_~i~0))} is VALID [2022-04-27 21:33:54,170 INFO L290 TraceCheckUtils]: 53: Hoare triple {1152#(and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 6)) (<= 3 main_~i~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:54,170 INFO L272 TraceCheckUtils]: 54: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,170 INFO L290 TraceCheckUtils]: 57: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,172 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {945#true} {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:54,173 INFO L272 TraceCheckUtils]: 59: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:33:54,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:33:54,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {1178#(<= 1 __VERIFIER_assert_~cond)} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:54,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {946#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 21:33:54,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:33:54,733 INFO L290 TraceCheckUtils]: 62: Hoare triple {946#false} [130] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:54,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {1178#(<= 1 __VERIFIER_assert_~cond)} [127] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {946#false} is VALID [2022-04-27 21:33:54,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1178#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:33:54,735 INFO L272 TraceCheckUtils]: 59: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1174#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:33:54,736 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {945#true} {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:54,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,737 INFO L272 TraceCheckUtils]: 54: Hoare triple {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {1212#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {979#(<= (+ main_~p~0 2) main_~bufsize_0~0)} is VALID [2022-04-27 21:33:54,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {1216#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1212#(or (not (< main_~i~0 main_~ielen~0)) (<= (+ main_~p~0 2) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,738 INFO L290 TraceCheckUtils]: 51: Hoare triple {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1216#(or (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:54,738 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {945#true} {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:54,738 INFO L290 TraceCheckUtils]: 49: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,739 INFO L272 TraceCheckUtils]: 46: Hoare triple {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,739 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {945#true} {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:54,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,740 INFO L272 TraceCheckUtils]: 41: Hoare triple {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,740 INFO L290 TraceCheckUtils]: 40: Hoare triple {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:54,741 INFO L290 TraceCheckUtils]: 39: Hoare triple {1257#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 2)))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1220#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 1)))} is VALID [2022-04-27 21:33:54,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1257#(or (<= (+ main_~p~0 4) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 2)))} is VALID [2022-04-27 21:33:54,742 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {945#true} {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,742 INFO L290 TraceCheckUtils]: 35: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,742 INFO L290 TraceCheckUtils]: 34: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,742 INFO L272 TraceCheckUtils]: 33: Hoare triple {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,743 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {945#true} {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,743 INFO L272 TraceCheckUtils]: 28: Hoare triple {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(or (<= main_~ielen~0 (+ main_~i~0 3)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} [129] L49-2-->L49-3: Formula: (= v_main_~i~0_1 (+ v_main_~i~0_2 1)) InVars {main_~i~0=v_main_~i~0_2} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1261#(or (<= main_~ielen~0 (+ main_~i~0 2)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,744 INFO L290 TraceCheckUtils]: 25: Hoare triple {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [126] L51-->L49-2: Formula: (= v_main_~p~0_3 (+ v_main_~p~0_4 2)) InVars {main_~p~0=v_main_~p~0_4} OutVars{main_~p~0=v_main_~p~0_3} AuxVars[] AssignedVars[main_~p~0] {1298#(or (<= main_~ielen~0 (+ main_~i~0 3)) (<= (+ main_~p~0 6) main_~bufsize_0~0))} is VALID [2022-04-27 21:33:54,745 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {945#true} {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [136] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} is VALID [2022-04-27 21:33:54,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,748 INFO L272 TraceCheckUtils]: 20: Hoare triple {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [124] L50-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (< (+ v_main_~p~0_9 1) v_main_~bufsize_0~0_4) 1 0)) InVars {main_~bufsize_0~0=v_main_~bufsize_0~0_4, main_~p~0=v_main_~p~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~bufsize_0~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,753 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {945#true} {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [135] __VERIFIER_assertEXIT-->L50-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} is VALID [2022-04-27 21:33:54,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {945#true} [132] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {945#true} [128] L18-->L18-2: Formula: (not (= 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[] {945#true} is VALID [2022-04-27 21:33:54,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {945#true} [125] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_3 |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_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {945#true} is VALID [2022-04-27 21:33:54,757 INFO L272 TraceCheckUtils]: 15: Hoare triple {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [123] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~p~0_8) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~p~0=v_main_~p~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} [122] L49-3-->L50: Formula: (and (< v_main_~i~0_6 v_main_~ielen~0_11) (< 2 v_main_~bufsize~0_14)) InVars {main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} OutVars{main_~i~0=v_main_~i~0_6, main_~bufsize~0=v_main_~bufsize~0_14, main_~ielen~0=v_main_~ielen~0_11} AuxVars[] AssignedVars[] {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} is VALID [2022-04-27 21:33:54,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 4))} [119] L47-->L49-3: Formula: (and (not (< v_main_~bufsize~0_12 (* 2 v_main_~ielen~0_9))) (= v_main_~i~0_4 0)) InVars {main_~ielen~0=v_main_~ielen~0_9, main_~bufsize~0=v_main_~bufsize~0_12} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_12, main_~ielen~0=v_main_~ielen~0_9} AuxVars[] AssignedVars[main_~i~0] {1302#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= main_~ielen~0 (+ main_~i~0 3)))} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {945#true} [117] L40-->L47: Formula: (and (= v_main_~p~0_6 v_main_~leader_len~0_9) (= v_main_~bufsize_0~0_3 v_main_~bufsize~0_10) (not (< v_main_~bufsize~0_10 v_main_~leader_len~0_9)) (= v_main_~bufsize~0_9 (+ (* (- 1) v_main_~leader_len~0_9) v_main_~bufsize~0_10))) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~leader_len~0=v_main_~leader_len~0_9} OutVars{main_~bufsize_0~0=v_main_~bufsize_0~0_3, main_~bufsize~0=v_main_~bufsize~0_9, main_~p~0=v_main_~p~0_6, main_~leader_len~0=v_main_~leader_len~0_9} AuxVars[] AssignedVars[main_~bufsize_0~0, main_~bufsize~0, main_~p~0] {1339#(or (<= (+ main_~p~0 8) main_~bufsize_0~0) (<= (div (+ (- 1) (* (- 1) main_~bufsize~0)) (- 2)) 4))} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {945#true} [114] L39-->L40: Formula: (< 0 v_main_~ielen~0_6) InVars {main_~ielen~0=v_main_~ielen~0_6} OutVars{main_~ielen~0=v_main_~ielen~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {945#true} [112] L38-1-->L39: Formula: (< 0 v_main_~bufsize~0_6) InVars {main_~bufsize~0=v_main_~bufsize~0_6} OutVars{main_~bufsize~0=v_main_~bufsize~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {945#true} [110] L38-->L38-1: Formula: (< 0 v_main_~leader_len~0_6) InVars {main_~leader_len~0=v_main_~leader_len~0_6} OutVars{main_~leader_len~0=v_main_~leader_len~0_6} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {945#true} [109] L37-->L38: Formula: (< v_main_~ielen~0_5 1000000) InVars {main_~ielen~0=v_main_~ielen~0_5} OutVars{main_~ielen~0=v_main_~ielen~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {945#true} [107] L36-->L37: Formula: (< v_main_~bufsize~0_5 1000000) InVars {main_~bufsize~0=v_main_~bufsize~0_5} OutVars{main_~bufsize~0=v_main_~bufsize~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {945#true} [104] L35-->L36: Formula: (< v_main_~leader_len~0_5 1000000) InVars {main_~leader_len~0=v_main_~leader_len~0_5} OutVars{main_~leader_len~0=v_main_~leader_len~0_5} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {945#true} [101] mainENTRY-->L35: Formula: (and (= |v_main_#t~nondet3_2| v_main_~ielen~0_1) (= v_main_~leader_len~0_1 |v_main_#t~nondet1_2|) (<= |v_main_#t~nondet3_2| 2147483647) (= v_main_~bufsize~0_1 |v_main_#t~nondet2_2|) (<= |v_main_#t~nondet1_2| 2147483647) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648)) (<= 0 (+ |v_main_#t~nondet3_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet3=|v_main_#t~nondet3_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~ielen~0=v_main_~ielen~0_1, main_~bufsize_0~0=v_main_~bufsize_0~0_2, main_~i~0=v_main_~i~0_3, main_~bufsize~0=v_main_~bufsize~0_1, main_~leader_len~0=v_main_~leader_len~0_1, main_~p~0=v_main_~p~0_5} AuxVars[] AssignedVars[main_~ielen~0, main_#t~nondet1, main_#t~nondet3, main_#t~nondet2, main_~bufsize_0~0, main_~i~0, main_~bufsize~0, main_~leader_len~0, main_~p~0] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {945#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {945#true} {945#true} [133] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {945#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#true} [99] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 9) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {945#true} is VALID [2022-04-27 21:33:54,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {945#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {945#true} is VALID [2022-04-27 21:33:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-27 21:33:54,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122625648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:33:54,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:33:54,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2022-04-27 21:33:54,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523820179] [2022-04-27 21:33:54,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:33:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 63 [2022-04-27 21:33:54,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:33:54,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-04-27 21:33:54,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-27 21:33:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:33:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-27 21:33:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-27 21:33:54,819 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-04-27 21:33:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:55,950 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-04-27 21:33:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-27 21:33:55,951 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) Word has length 63 [2022-04-27 21:33:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:33:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-04-27 21:33:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-27 21:33:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-04-27 21:33:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2022-04-27 21:33:55,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2022-04-27 21:33:55,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:33:55,997 INFO L225 Difference]: With dead ends: 56 [2022-04-27 21:33:55,997 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:33:55,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=396, Invalid=1674, Unknown=0, NotChecked=0, Total=2070 [2022-04-27 21:33:55,998 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 21:33:55,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 72 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 21:33:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:33:55,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:33:55,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:33:55,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:33:55,999 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:33:55,999 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:33:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:55,999 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:33:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:33:56,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:56,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:56,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:33:56,000 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 21:33:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:33:56,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:33:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:33:56,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:56,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:33:56,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:33:56,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:33:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 21:33:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:33:56,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 63 [2022-04-27 21:33:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:33:56,001 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:33:56,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 10 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-04-27 21:33:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:33:56,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:33:56,004 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:33:56,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 21:33:56,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:33:56,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:33:56,308 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:33:56,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:33:56,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:33:56,308 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:33:56,308 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 24 56) the Hoare annotation is: true [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L902 garLoopResultBuilder]: At program point L54(lines 24 56) the Hoare annotation is: true [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 24 56) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L38-1(lines 25 56) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L39(lines 25 56) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L40(lines 25 56) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2022-04-27 21:33:56,309 INFO L895 garLoopResultBuilder]: At program point L49-3(lines 49 53) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= 1 main_~leader_len~0)) [2022-04-27 21:33:56,309 INFO L895 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-27 21:33:56,310 INFO L895 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: (and (<= (+ main_~p~0 (* 2 main_~ielen~0)) (+ main_~bufsize_0~0 (* main_~i~0 2))) (<= 1 main_~p~0) (<= (+ main_~p~0 2) main_~bufsize_0~0) (<= 1 main_~leader_len~0)) [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point L51(line 51) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point L49-2(lines 49 53) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-27 21:33:56,310 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-27 21:33:56,312 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-27 21:33:56,313 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:33:56,316 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L38-1 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:33:56,317 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 21:33:56,319 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 21:33:56,319 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-27 21:33:56,319 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 21:33:56,319 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-27 21:33:56,319 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-27 21:33:56,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:33:56 BasicIcfg [2022-04-27 21:33:56,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:33:56,327 INFO L158 Benchmark]: Toolchain (without parser) took 6751.22ms. Allocated memory was 183.5MB in the beginning and 276.8MB in the end (delta: 93.3MB). Free memory was 130.1MB in the beginning and 218.0MB in the end (delta: -87.8MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,327 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:33:56,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 196.48ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 158.6MB in the end (delta: -28.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,327 INFO L158 Benchmark]: Boogie Preprocessor took 18.93ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 156.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,327 INFO L158 Benchmark]: RCFGBuilder took 262.58ms. Allocated memory is still 183.5MB. Free memory was 156.8MB in the beginning and 144.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,328 INFO L158 Benchmark]: IcfgTransformer took 51.29ms. Allocated memory is still 183.5MB. Free memory was 144.2MB in the beginning and 141.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,328 INFO L158 Benchmark]: TraceAbstraction took 6215.55ms. Allocated memory was 183.5MB in the beginning and 276.8MB in the end (delta: 93.3MB). Free memory was 141.4MB in the beginning and 218.0MB in the end (delta: -76.5MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2022-04-27 21:33:56,329 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.09ms. Allocated memory is still 183.5MB. Free memory is still 146.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 196.48ms. Allocated memory is still 183.5MB. Free memory was 130.0MB in the beginning and 158.6MB in the end (delta: -28.6MB). Peak memory consumption was 10.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.93ms. Allocated memory is still 183.5MB. Free memory was 158.6MB in the beginning and 156.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 262.58ms. Allocated memory is still 183.5MB. Free memory was 156.8MB in the beginning and 144.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 51.29ms. Allocated memory is still 183.5MB. Free memory was 144.2MB in the beginning and 141.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6215.55ms. Allocated memory was 183.5MB in the beginning and 276.8MB in the end (delta: 93.3MB). Free memory was 141.4MB in the beginning and 218.0MB in the end (delta: -76.5MB). Peak memory consumption was 17.2MB. 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: 19]: 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 4 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 236 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 862 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 103 mSDtfsCounter, 862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 204 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 20 PreInvPairs, 38 NumberOfFragments, 76 HoareAnnotationTreeSize, 20 FomulaSimplifications, 14 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 290 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 335 ConstructedInterpolants, 0 QuantifiedInterpolants, 1211 SizeOfPredicates, 16 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 357/431 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: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (p + 2 * ielen <= bufsize_0 + i * 2 && 1 <= p) && 1 <= leader_len RESULT: Ultimate proved your program to be correct! [2022-04-27 21:33:56,358 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...