/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/SpamAssassin-loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 00:32:43,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 00:32:43,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 00:32:43,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 00:32:43,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 00:32:43,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 00:32:43,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 00:32:43,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 00:32:43,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 00:32:43,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 00:32:43,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 00:32:43,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 00:32:43,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 00:32:43,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 00:32:43,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 00:32:43,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 00:32:43,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 00:32:43,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 00:32:43,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 00:32:43,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 00:32:43,738 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 00:32:43,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 00:32:43,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 00:32:43,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 00:32:43,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 00:32:43,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 00:32:43,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 00:32:43,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 00:32:43,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 00:32:43,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 00:32:43,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 00:32:43,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 00:32:43,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 00:32:43,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 00:32:43,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 00:32:43,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 00:32:43,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 00:32:43,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 00:32:43,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 00:32:43,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 00:32:43,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 00:32:43,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 00:32:43,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 00:32:43,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 00:32:43,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 00:32:43,772 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 00:32:43,772 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 00:32:43,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 00:32:43,773 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 00:32:43,773 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 00:32:43,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 00:32:43,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 00:32:43,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 00:32:43,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 00:32:43,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 00:32:43,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 00:32:43,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 00:32:43,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:43,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 00:32:43,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 00:32:43,777 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 00:32:43,777 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 00:32:43,777 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 00:32:44,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 00:32:44,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 00:32:44,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 00:32:44,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 00:32:44,051 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 00:32:44,052 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-15 00:32:44,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703e82b29/11c818041f3a490daba3574e68910d85/FLAGdbabc7873 [2022-04-15 00:32:44,445 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 00:32:44,445 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/SpamAssassin-loop.i [2022-04-15 00:32:44,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703e82b29/11c818041f3a490daba3574e68910d85/FLAGdbabc7873 [2022-04-15 00:32:44,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/703e82b29/11c818041f3a490daba3574e68910d85 [2022-04-15 00:32:44,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 00:32:44,474 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 00:32:44,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:44,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 00:32:44,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 00:32:44,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7041b942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44, skipping insertion in model container [2022-04-15 00:32:44,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 00:32:44,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 00:32:44,719 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/SpamAssassin-loop.i[893,906] [2022-04-15 00:32:44,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:44,763 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 00:32:44,778 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/SpamAssassin-loop.i[893,906] [2022-04-15 00:32:44,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 00:32:44,812 INFO L208 MainTranslator]: Completed translation [2022-04-15 00:32:44,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44 WrapperNode [2022-04-15 00:32:44,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 00:32:44,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 00:32:44,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 00:32:44,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 00:32:44,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 00:32:44,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 00:32:44,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 00:32:44,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 00:32:44,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (1/1) ... [2022-04-15 00:32:44,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 00:32:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 00:32:44,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 00:32:44,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 00:32:44,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 00:32:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 00:32:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 00:32:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 00:32:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 00:32:44,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 00:32:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 00:32:44,921 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 00:32:44,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 00:32:44,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 00:32:45,002 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 00:32:45,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 00:32:45,289 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 00:32:45,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 00:32:45,297 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 00:32:45,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:45 BoogieIcfgContainer [2022-04-15 00:32:45,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 00:32:45,299 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 00:32:45,299 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 00:32:45,301 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 00:32:45,303 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:45" (1/1) ... [2022-04-15 00:32:45,305 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 00:32:45,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:45 BasicIcfg [2022-04-15 00:32:45,361 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 00:32:45,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 00:32:45,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 00:32:45,367 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 00:32:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:44" (1/4) ... [2022-04-15 00:32:45,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3226c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:45, skipping insertion in model container [2022-04-15 00:32:45,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:44" (2/4) ... [2022-04-15 00:32:45,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3226c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:45, skipping insertion in model container [2022-04-15 00:32:45,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:45" (3/4) ... [2022-04-15 00:32:45,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3226c285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:45, skipping insertion in model container [2022-04-15 00:32:45,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 12:32:45" (4/4) ... [2022-04-15 00:32:45,370 INFO L111 eAbstractionObserver]: Analyzing ICFG SpamAssassin-loop.iqvasr [2022-04-15 00:32:45,374 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 00:32:45,374 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 00:32:45,412 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 00:32:45,418 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 00:32:45,418 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 00:32:45,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:32:45,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:45,440 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:45,440 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:45,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -868390563, now seen corresponding path program 1 times [2022-04-15 00:32:45,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:45,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7763729] [2022-04-15 00:32:45,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:45,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:45,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {46#true} is VALID [2022-04-15 00:32:45,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46#true} {46#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {46#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:45,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {46#true} is VALID [2022-04-15 00:32:45,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46#true} {46#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {46#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {46#true} is VALID [2022-04-15 00:32:45,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {46#true} is VALID [2022-04-15 00:32:45,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {46#true} is VALID [2022-04-15 00:32:45,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#true} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {46#true} is VALID [2022-04-15 00:32:45,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#true} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {51#(not (<= main_~len~0 (+ main_~i~0 1)))} is VALID [2022-04-15 00:32:45,725 INFO L272 TraceCheckUtils]: 10: Hoare triple {51#(not (<= main_~len~0 (+ main_~i~0 1)))} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {52#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:45,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {52#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:45,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {47#false} is VALID [2022-04-15 00:32:45,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47#false} is VALID [2022-04-15 00:32:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:45,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:45,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7763729] [2022-04-15 00:32:45,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7763729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:45,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:45,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864231345] [2022-04-15 00:32:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:45,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:45,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:45,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:45,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:45,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:45,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:45,787 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:46,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:46,625 INFO L93 Difference]: Finished difference Result 88 states and 155 transitions. [2022-04-15 00:32:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:46,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-15 00:32:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:46,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2022-04-15 00:32:46,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 155 transitions. [2022-04-15 00:32:46,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:46,824 INFO L225 Difference]: With dead ends: 88 [2022-04-15 00:32:46,824 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 00:32:46,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:46,831 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 34 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:46,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 68 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 00:32:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-04-15 00:32:46,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:46,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:46,871 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:46,872 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:46,880 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-15 00:32:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-15 00:32:46,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:46,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:46,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 47 states. [2022-04-15 00:32:46,884 INFO L87 Difference]: Start difference. First operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 47 states. [2022-04-15 00:32:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:46,892 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-04-15 00:32:46,893 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2022-04-15 00:32:46,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:46,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:46,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:46,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 19 states have call successors, (19), 4 states have call predecessors, (19), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2022-04-15 00:32:46,908 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 14 [2022-04-15 00:32:46,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:46,908 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2022-04-15 00:32:46,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-04-15 00:32:46,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 00:32:46,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:46,909 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:46,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 00:32:46,910 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:46,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -867437251, now seen corresponding path program 1 times [2022-04-15 00:32:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:46,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974726824] [2022-04-15 00:32:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:46,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:46,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {362#true} is VALID [2022-04-15 00:32:46,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#true} is VALID [2022-04-15 00:32:46,982 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {362#true} {362#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#true} is VALID [2022-04-15 00:32:46,982 INFO L272 TraceCheckUtils]: 0: Hoare triple {362#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:46,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {362#true} is VALID [2022-04-15 00:32:46,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#true} is VALID [2022-04-15 00:32:46,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {362#true} {362#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#true} is VALID [2022-04-15 00:32:46,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {362#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {362#true} is VALID [2022-04-15 00:32:46,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {362#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {362#true} is VALID [2022-04-15 00:32:46,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {362#true} is VALID [2022-04-15 00:32:46,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 00:32:46,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 00:32:46,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {367#(not (<= main_~len~0 main_~i~0))} is VALID [2022-04-15 00:32:46,986 INFO L272 TraceCheckUtils]: 10: Hoare triple {367#(not (<= main_~len~0 main_~i~0))} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:46,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:46,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {363#false} is VALID [2022-04-15 00:32:46,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {363#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {363#false} is VALID [2022-04-15 00:32:46,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 00:32:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:46,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974726824] [2022-04-15 00:32:46,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974726824] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:46,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:46,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956435276] [2022-04-15 00:32:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:46,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:46,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:47,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:47,001 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:47,002 INFO L87 Difference]: Start difference. First operand 43 states and 61 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:47,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,624 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2022-04-15 00:32:47,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:47,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-15 00:32:47,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 00:32:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:47,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 00:32:47,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 00:32:47,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:47,699 INFO L225 Difference]: With dead ends: 55 [2022-04-15 00:32:47,699 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 00:32:47,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:47,701 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:47,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 52 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 00:32:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-15 00:32:47,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:47,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:47,730 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:47,730 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:47,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,734 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 00:32:47,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 00:32:47,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:47,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:47,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 53 states. [2022-04-15 00:32:47,736 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 53 states. [2022-04-15 00:32:47,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:47,739 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 00:32:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 70 transitions. [2022-04-15 00:32:47,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:47,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:47,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:47,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 67 transitions. [2022-04-15 00:32:47,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 67 transitions. Word has length 14 [2022-04-15 00:32:47,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:47,744 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 67 transitions. [2022-04-15 00:32:47,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 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-15 00:32:47,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 67 transitions. [2022-04-15 00:32:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 00:32:47,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:47,745 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:47,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 00:32:47,745 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:47,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:47,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1607544442, now seen corresponding path program 1 times [2022-04-15 00:32:47,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:47,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869065979] [2022-04-15 00:32:47,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:47,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {649#true} is VALID [2022-04-15 00:32:47,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {649#true} {649#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:47,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {649#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {649#true} is VALID [2022-04-15 00:32:47,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {654#(<= 0 main_~i~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:47,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {649#true} is VALID [2022-04-15 00:32:47,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {649#true} is VALID [2022-04-15 00:32:47,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(<= 0 main_~i~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,827 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(<= 0 main_~i~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(<= 0 main_~i~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,828 INFO L272 TraceCheckUtils]: 10: Hoare triple {654#(<= 0 main_~i~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {649#true} is VALID [2022-04-15 00:32:47,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {649#true} is VALID [2022-04-15 00:32:47,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {649#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {649#true} is VALID [2022-04-15 00:32:47,829 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {649#true} {654#(<= 0 main_~i~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {654#(<= 0 main_~i~0)} is VALID [2022-04-15 00:32:47,830 INFO L272 TraceCheckUtils]: 15: Hoare triple {654#(<= 0 main_~i~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {659#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:47,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {660#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:47,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {650#false} is VALID [2022-04-15 00:32:47,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {650#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {650#false} is VALID [2022-04-15 00:32:47,832 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-15 00:32:47,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:47,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869065979] [2022-04-15 00:32:47,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869065979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:47,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:47,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525375034] [2022-04-15 00:32:47,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:47,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2022-04-15 00:32:47,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:47,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-15 00:32:47,847 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-15 00:32:47,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:47,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:47,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:47,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:47,849 INFO L87 Difference]: Start difference. First operand 51 states and 67 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-15 00:32:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,384 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2022-04-15 00:32:48,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:48,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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 19 [2022-04-15 00:32:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-15 00:32:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 00:32:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-15 00:32:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-04-15 00:32:48,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-04-15 00:32:48,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:48,455 INFO L225 Difference]: With dead ends: 57 [2022-04-15 00:32:48,455 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 00:32:48,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:48,457 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:48,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:32:48,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 00:32:48,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 00:32:48,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:48,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:48,488 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:48,488 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,491 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 00:32:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 00:32:48,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 55 states. [2022-04-15 00:32:48,493 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 55 states. [2022-04-15 00:32:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:48,496 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 00:32:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 00:32:48,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:48,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:48,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:48,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-15 00:32:48,500 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 19 [2022-04-15 00:32:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:48,500 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-15 00:32:48,500 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 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-15 00:32:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 00:32:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 00:32:48,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:48,501 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:48,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 00:32:48,502 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1153064602, now seen corresponding path program 1 times [2022-04-15 00:32:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:48,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947687934] [2022-04-15 00:32:48,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:48,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {950#true} is VALID [2022-04-15 00:32:48,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {950#true} {950#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {950#true} is VALID [2022-04-15 00:32:48,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 00:32:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:48,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {950#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {950#true} is VALID [2022-04-15 00:32:48,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {950#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {950#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:48,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {950#true} is VALID [2022-04-15 00:32:48,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {950#true} {950#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {950#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {950#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {950#true} is VALID [2022-04-15 00:32:48,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {950#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {955#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,588 INFO L272 TraceCheckUtils]: 10: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {950#true} is VALID [2022-04-15 00:32:48,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {950#true} is VALID [2022-04-15 00:32:48,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {950#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,589 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,590 INFO L272 TraceCheckUtils]: 15: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [151] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {950#true} is VALID [2022-04-15 00:32:48,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {950#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {950#true} is VALID [2022-04-15 00:32:48,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {950#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {950#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {950#true} is VALID [2022-04-15 00:32:48,591 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {950#true} {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:48,592 INFO L272 TraceCheckUtils]: 20: Hoare triple {956#(<= (+ 5 main_~j~0) main_~bufsize~0)} [155] L58-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {965#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:48,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {965#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {966#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:48,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {966#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {951#false} is VALID [2022-04-15 00:32:48,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {951#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {951#false} is VALID [2022-04-15 00:32:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 00:32:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:48,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947687934] [2022-04-15 00:32:48,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947687934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:48,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:48,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:32:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45045531] [2022-04-15 00:32:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 00:32:48,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:48,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:32:48,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:48,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:48,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:48,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:48,611 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:32:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,283 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-15 00:32:49,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:49,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-15 00:32:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:49,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:32:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-15 00:32:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:32:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2022-04-15 00:32:49,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 61 transitions. [2022-04-15 00:32:49,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:49,360 INFO L225 Difference]: With dead ends: 61 [2022-04-15 00:32:49,360 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 00:32:49,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:49,361 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:49,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 00:32:49,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 00:32:49,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:49,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:49,411 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:49,411 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:49,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,415 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 00:32:49,415 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 00:32:49,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 59 states. [2022-04-15 00:32:49,416 INFO L87 Difference]: Start difference. First operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 59 states. [2022-04-15 00:32:49,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:49,419 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-15 00:32:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 00:32:49,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:49,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:49,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:49,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-15 00:32:49,423 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 24 [2022-04-15 00:32:49,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:49,424 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2022-04-15 00:32:49,424 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 00:32:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-15 00:32:49,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 00:32:49,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:49,425 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:49,425 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 00:32:49,425 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:49,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1359459551, now seen corresponding path program 1 times [2022-04-15 00:32:49,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266597910] [2022-04-15 00:32:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:49,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {1276#true} is VALID [2022-04-15 00:32:49,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1276#true} {1276#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 00:32:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-15 00:32:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:49,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [192] __VERIFIER_assertEXIT-->L59: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {1276#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:49,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {1296#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {1276#true} is VALID [2022-04-15 00:32:49,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {1276#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {1276#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {1276#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {1276#true} is VALID [2022-04-15 00:32:49,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {1276#true} is VALID [2022-04-15 00:32:49,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {1276#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {1281#(<= 0 main_~j~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {1281#(<= 0 main_~j~0)} [146] L36-->L56: Formula: (not (< (+ v_main_~i~0_21 1) v_main_~len~0_11)) InVars {main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} OutVars{main_~i~0=v_main_~i~0_21, main_~len~0=v_main_~len~0_11} AuxVars[] AssignedVars[] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,508 INFO L272 TraceCheckUtils]: 10: Hoare triple {1281#(<= 0 main_~j~0)} [148] L56-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1276#true} is VALID [2022-04-15 00:32:49,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,510 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [190] __VERIFIER_assertEXIT-->L57: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_29 v_main_~len~0_16) 1 0) |v___VERIFIER_assert_#in~condInParam_13|) InVars {main_~i~0=v_main_~i~0_29, main_~len~0=v_main_~len~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_13|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,510 INFO L272 TraceCheckUtils]: 15: Hoare triple {1281#(<= 0 main_~j~0)} [151] L57-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1276#true} is VALID [2022-04-15 00:32:49,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,511 INFO L290 TraceCheckUtils]: 18: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,511 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [191] __VERIFIER_assertEXIT-->L58: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_30) 1 0) |v___VERIFIER_assert_#in~condInParam_14|) InVars {main_~i~0=v_main_~i~0_30} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_14|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,512 INFO L272 TraceCheckUtils]: 20: Hoare triple {1281#(<= 0 main_~j~0)} [155] L58-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1276#true} is VALID [2022-04-15 00:32:49,512 INFO L290 TraceCheckUtils]: 21: Hoare triple {1276#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1276#true} is VALID [2022-04-15 00:32:49,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {1276#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1276#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1276#true} is VALID [2022-04-15 00:32:49,513 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1276#true} {1281#(<= 0 main_~j~0)} [192] __VERIFIER_assertEXIT-->L59: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_27 v_main_~bufsize~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_15|) InVars {main_~bufsize~0=v_main_~bufsize~0_13, main_~j~0=v_main_~j~0_27} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_15|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1281#(<= 0 main_~j~0)} is VALID [2022-04-15 00:32:49,513 INFO L272 TraceCheckUtils]: 25: Hoare triple {1281#(<= 0 main_~j~0)} [161] L59-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_28) 1 0) |v___VERIFIER_assert_#in~condInParam_16|) InVars {main_~j~0=v_main_~j~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_16|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:49,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {1294#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1295#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:49,514 INFO L290 TraceCheckUtils]: 27: Hoare triple {1295#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1277#false} is VALID [2022-04-15 00:32:49,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {1277#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1277#false} is VALID [2022-04-15 00:32:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 00:32:49,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:49,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266597910] [2022-04-15 00:32:49,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266597910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:49,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:49,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 00:32:49,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330817843] [2022-04-15 00:32:49,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 00:32:49,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:49,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 00:32:49,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:49,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 00:32:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:49,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 00:32:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 00:32:49,533 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 00:32:50,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,035 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2022-04-15 00:32:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 00:32:50,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-04-15 00:32:50,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:50,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 00:32:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 00:32:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 00:32:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 00:32:50,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-15 00:32:50,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:50,099 INFO L225 Difference]: With dead ends: 66 [2022-04-15 00:32:50,099 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 00:32:50,099 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 00:32:50,100 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:50,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 53 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 00:32:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 00:32:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-15 00:32:50,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:50,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:50,160 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:50,160 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,164 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 00:32:50,164 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 00:32:50,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:50,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:50,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-15 00:32:50,165 INFO L87 Difference]: Start difference. First operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 64 states. [2022-04-15 00:32:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:50,168 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-15 00:32:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-15 00:32:50,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:50,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:50,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:50,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 19 states have call successors, (19), 9 states have call predecessors, (19), 8 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-15 00:32:50,171 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 29 [2022-04-15 00:32:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:50,172 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-15 00:32:50,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 00:32:50,172 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-15 00:32:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 00:32:50,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:50,173 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:50,173 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 00:32:50,174 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:50,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:50,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1056918318, now seen corresponding path program 1 times [2022-04-15 00:32:50,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:50,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051588076] [2022-04-15 00:32:50,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {1625#true} is VALID [2022-04-15 00:32:50,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1625#true} {1625#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,258 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 00:32:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 00:32:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 00:32:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 00:32:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:32:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:50,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1625#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:50,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1658#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {1625#true} is VALID [2022-04-15 00:32:50,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1625#true} {1625#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {1625#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {1625#true} is VALID [2022-04-15 00:32:50,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {1625#true} is VALID [2022-04-15 00:32:50,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {1625#true} is VALID [2022-04-15 00:32:50,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#true} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,291 INFO L272 TraceCheckUtils]: 10: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1625#true} is VALID [2022-04-15 00:32:50,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,295 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,295 INFO L272 TraceCheckUtils]: 15: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1625#true} is VALID [2022-04-15 00:32:50,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,301 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,302 INFO L272 TraceCheckUtils]: 22: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1625#true} is VALID [2022-04-15 00:32:50,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,306 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,307 INFO L272 TraceCheckUtils]: 27: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1625#true} is VALID [2022-04-15 00:32:50,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,308 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,308 INFO L272 TraceCheckUtils]: 32: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1625#true} is VALID [2022-04-15 00:32:50,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,309 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,309 INFO L272 TraceCheckUtils]: 37: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1625#true} is VALID [2022-04-15 00:32:50,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1625#true} is VALID [2022-04-15 00:32:50,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#true} is VALID [2022-04-15 00:32:50,314 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1625#true} {1630#(<= (+ main_~i~0 2) main_~len~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {1630#(<= (+ main_~i~0 2) main_~len~0)} is VALID [2022-04-15 00:32:50,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {1630#(<= (+ main_~i~0 2) main_~len~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {1655#(<= (+ main_~i~0 1) main_~len~0)} is VALID [2022-04-15 00:32:50,315 INFO L272 TraceCheckUtils]: 43: Hoare triple {1655#(<= (+ main_~i~0 1) main_~len~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {1656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:50,316 INFO L290 TraceCheckUtils]: 44: Hoare triple {1656#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1657#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:50,316 INFO L290 TraceCheckUtils]: 45: Hoare triple {1657#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1626#false} is VALID [2022-04-15 00:32:50,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {1626#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1626#false} is VALID [2022-04-15 00:32:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-15 00:32:50,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:50,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051588076] [2022-04-15 00:32:50,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051588076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:50,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:50,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 00:32:50,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387397344] [2022-04-15 00:32:50,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:50,318 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 00:32:50,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:50,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 00:32:50,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:50,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 00:32:50,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:50,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 00:32:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 00:32:50,354 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 00:32:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,054 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 00:32:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 00:32:51,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 00:32:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 00:32:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 00:32:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 00:32:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 00:32:51,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-15 00:32:51,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:51,130 INFO L225 Difference]: With dead ends: 75 [2022-04-15 00:32:51,130 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 00:32:51,131 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 00:32:51,131 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:51,132 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 57 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 00:32:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-15 00:32:51,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:51,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:51,217 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:51,218 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,221 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-15 00:32:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-15 00:32:51,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 00:32:51,222 INFO L87 Difference]: Start difference. First operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 00:32:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:51,225 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-15 00:32:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2022-04-15 00:32:51,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:51,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:51,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:51,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 19 states have call successors, (19), 10 states have call predecessors, (19), 9 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-04-15 00:32:51,228 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 47 [2022-04-15 00:32:51,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:51,229 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-04-15 00:32:51,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 00:32:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-04-15 00:32:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 00:32:51,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:51,230 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:51,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 00:32:51,230 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:51,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1366093938, now seen corresponding path program 1 times [2022-04-15 00:32:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:51,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30917655] [2022-04-15 00:32:51,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {2028#true} is VALID [2022-04-15 00:32:51,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2028#true} {2028#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 00:32:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 00:32:51,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 00:32:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 00:32:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:32:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 00:32:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 00:32:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:51,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:51,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {2028#true} is VALID [2022-04-15 00:32:51,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {2028#true} is VALID [2022-04-15 00:32:51,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {2028#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2033#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,445 INFO L272 TraceCheckUtils]: 10: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,448 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,448 INFO L272 TraceCheckUtils]: 15: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,449 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,450 INFO L272 TraceCheckUtils]: 22: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,451 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,451 INFO L272 TraceCheckUtils]: 27: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,452 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,453 INFO L272 TraceCheckUtils]: 32: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2028#true} is VALID [2022-04-15 00:32:51,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,455 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,455 INFO L272 TraceCheckUtils]: 37: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2028#true} is VALID [2022-04-15 00:32:51,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,456 INFO L290 TraceCheckUtils]: 40: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,456 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2028#true} {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {2034#(<= (+ 5 main_~j~0) main_~bufsize~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,457 INFO L272 TraceCheckUtils]: 43: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,458 INFO L290 TraceCheckUtils]: 45: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,458 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,459 INFO L272 TraceCheckUtils]: 48: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [168] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2028#true} is VALID [2022-04-15 00:32:51,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {2028#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2028#true} is VALID [2022-04-15 00:32:51,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {2028#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,459 INFO L290 TraceCheckUtils]: 51: Hoare triple {2028#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-15 00:32:51,460 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2028#true} {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:51,460 INFO L272 TraceCheckUtils]: 53: Hoare triple {2059#(<= (+ main_~j~0 4) main_~bufsize~0)} [169] L47-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2068#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:51,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {2068#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2069#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:51,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {2069#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2029#false} is VALID [2022-04-15 00:32:51,461 INFO L290 TraceCheckUtils]: 56: Hoare triple {2029#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2029#false} is VALID [2022-04-15 00:32:51,463 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 00:32:51,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30917655] [2022-04-15 00:32:51,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30917655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:51,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:51,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 00:32:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835786827] [2022-04-15 00:32:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-15 00:32:51,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:51,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 00:32:51,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:51,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 00:32:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:51,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 00:32:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 00:32:51,497 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 00:32:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,186 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2022-04-15 00:32:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 00:32:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 57 [2022-04-15 00:32:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 00:32:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:32:52,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 00:32:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2022-04-15 00:32:52,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 64 transitions. [2022-04-15 00:32:52,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:52,265 INFO L225 Difference]: With dead ends: 75 [2022-04-15 00:32:52,265 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 00:32:52,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 00:32:52,266 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:52,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 59 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 00:32:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 00:32:52,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:52,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:52,340 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:52,341 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,343 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 00:32:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-15 00:32:52,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:52,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:52,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 00:32:52,344 INFO L87 Difference]: Start difference. First operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-15 00:32:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:52,347 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 00:32:52,347 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-04-15 00:32:52,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:52,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:52,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:52,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 states have internal predecessors, (45), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 00:32:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 82 transitions. [2022-04-15 00:32:52,350 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 82 transitions. Word has length 57 [2022-04-15 00:32:52,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:52,350 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 82 transitions. [2022-04-15 00:32:52,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 3 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-15 00:32:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 82 transitions. [2022-04-15 00:32:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 00:32:52,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 00:32:52,352 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:52,352 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 00:32:52,352 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 00:32:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 00:32:52,352 INFO L85 PathProgramCache]: Analyzing trace with hash -430516171, now seen corresponding path program 1 times [2022-04-15 00:32:52,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 00:32:52,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506533678] [2022-04-15 00:32:52,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 00:32:52,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 00:32:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 00:32:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {2444#true} is VALID [2022-04-15 00:32:52,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2444#true} {2444#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-15 00:32:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-15 00:32:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 00:32:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 00:32:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-15 00:32:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-15 00:32:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-15 00:32:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-15 00:32:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-15 00:32:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [186] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-15 00:32:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 00:32:52,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [187] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {2444#true} [129] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 00:32:52,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [131] 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] {2444#true} is VALID [2022-04-15 00:32:52,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {2444#true} [134] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2444#true} {2444#true} [176] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {2444#true} [130] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {2444#true} [133] mainENTRY-->L31: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~bufsize~0_2 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|} OutVars{main_~i~0=v_main_~i~0_4, main_~bufsize~0=v_main_~bufsize~0_2, main_~len~0=v_main_~len~0_1, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[main_#t~nondet1, main_~len~0, main_~j~0, main_~i~0, main_~bufsize~0] {2444#true} is VALID [2022-04-15 00:32:52,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {2444#true} [136] L31-->L34-2: Formula: (and (not (< v_main_~bufsize~0_6 0)) (= v_main_~i~0_5 0) (= |v_main_#t~nondet2_2| v_main_~len~0_2) (= v_main_~limit~0_1 (+ v_main_~bufsize~0_6 (- 4))) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647)) InVars {main_~bufsize~0=v_main_~bufsize~0_6, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~i~0=v_main_~i~0_5, main_~bufsize~0=v_main_~bufsize~0_6, main_~limit~0=v_main_~limit~0_1, main_~len~0=v_main_~len~0_2} AuxVars[] AssignedVars[main_~limit~0, main_~len~0, main_#t~nondet2, main_~i~0] {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} [140] L34-2-->L35-2: Formula: (and (= v_main_~j~0_6 0) (< v_main_~i~0_7 v_main_~len~0_4)) InVars {main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4} OutVars{main_~i~0=v_main_~i~0_7, main_~len~0=v_main_~len~0_4, main_~j~0=v_main_~j~0_6} AuxVars[] AssignedVars[main_~j~0] {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {2449#(<= (+ main_~limit~0 4) main_~bufsize~0)} [144] L35-2-->L36: Formula: (and (< v_main_~i~0_9 v_main_~len~0_6) (< v_main_~j~0_8 v_main_~limit~0_3)) InVars {main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} OutVars{main_~i~0=v_main_~i~0_9, main_~len~0=v_main_~len~0_6, main_~limit~0=v_main_~limit~0_3, main_~j~0=v_main_~j~0_8} AuxVars[] AssignedVars[] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [145] L36-->L37: Formula: (< (+ v_main_~i~0_10 1) v_main_~len~0_7) InVars {main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} OutVars{main_~i~0=v_main_~i~0_10, main_~len~0=v_main_~len~0_7} AuxVars[] AssignedVars[] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,512 INFO L272 TraceCheckUtils]: 10: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [147] L37-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,513 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [178] __VERIFIER_assertEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (< (+ v_main_~i~0_23 1) v_main_~len~0_13) 1 0)) InVars {main_~i~0=v_main_~i~0_23, main_~len~0=v_main_~len~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,513 INFO L272 TraceCheckUtils]: 15: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [149] L37-1-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,519 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [179] __VERIFIER_assertEXIT-->L38: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~i~0_24) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~i~0=v_main_~i~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [152] L38-->L39: Formula: (and (<= |v_main_#t~nondet3_1| 2147483647) (<= 0 (+ |v_main_#t~nondet3_1| 2147483648))) InVars {main_#t~nondet3=|v_main_#t~nondet3_1|} OutVars{main_#t~nondet3=|v_main_#t~nondet3_1|} AuxVars[] AssignedVars[] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [157] L39-->L40: Formula: (= |v_main_#t~nondet3_5| 0) InVars {main_#t~nondet3=|v_main_#t~nondet3_5|} OutVars{} AuxVars[] AssignedVars[main_#t~nondet3] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,521 INFO L272 TraceCheckUtils]: 22: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [162] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,524 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [180] __VERIFIER_assertEXIT-->L40-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_3| (ite (< v_main_~i~0_25 v_main_~len~0_14) 1 0)) InVars {main_~i~0=v_main_~i~0_25, main_~len~0=v_main_~len~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,524 INFO L272 TraceCheckUtils]: 27: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [164] L40-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,526 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [181] __VERIFIER_assertEXIT-->L41: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (<= 0 v_main_~i~0_26) 1 0)) InVars {main_~i~0=v_main_~i~0_26} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,527 INFO L272 TraceCheckUtils]: 32: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [165] L41-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2444#true} is VALID [2022-04-15 00:32:52,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,527 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [182] __VERIFIER_assertEXIT-->L42: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (< v_main_~j~0_21 v_main_~bufsize~0_10) 1 0)) InVars {main_~bufsize~0=v_main_~bufsize~0_10, main_~j~0=v_main_~j~0_21} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,528 INFO L272 TraceCheckUtils]: 37: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [166] L42-->__VERIFIER_assertENTRY: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2444#true} is VALID [2022-04-15 00:32:52,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,528 INFO L290 TraceCheckUtils]: 39: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,528 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2444#true} {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [183] __VERIFIER_assertEXIT-->L43: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 0 v_main_~j~0_22) 1 0) |v___VERIFIER_assert_#in~condInParam_6|) InVars {main_~j~0=v_main_~j~0_22} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_6|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {2450#(<= (+ 5 main_~j~0) main_~bufsize~0)} [167] L43-->L46: Formula: (and (= v_main_~i~0_15 (+ v_main_~i~0_16 1)) (= v_main_~j~0_11 (+ v_main_~j~0_12 1))) InVars {main_~i~0=v_main_~i~0_16, main_~j~0=v_main_~j~0_12} OutVars{main_~i~0=v_main_~i~0_15, main_#t~post4=|v_main_#t~post4_1|, main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_11} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post4, main_#t~post5] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,529 INFO L272 TraceCheckUtils]: 43: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [174] L46-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,529 INFO L290 TraceCheckUtils]: 45: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,530 INFO L290 TraceCheckUtils]: 46: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,530 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [184] __VERIFIER_assertEXIT-->L46-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_7| (ite (< v_main_~i~0_27 v_main_~len~0_15) 1 0)) InVars {main_~i~0=v_main_~i~0_27, main_~len~0=v_main_~len~0_15} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_7|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~len~0, main_~i~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,530 INFO L272 TraceCheckUtils]: 48: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [168] L46-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2444#true} is VALID [2022-04-15 00:32:52,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,530 INFO L290 TraceCheckUtils]: 50: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,531 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [185] __VERIFIER_assertEXIT-->L47: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_8| (ite (<= 0 v_main_~i~0_28) 1 0)) InVars {main_~i~0=v_main_~i~0_28} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_8|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,531 INFO L272 TraceCheckUtils]: 53: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [169] L47-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2444#true} is VALID [2022-04-15 00:32:52,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,531 INFO L290 TraceCheckUtils]: 55: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,532 INFO L290 TraceCheckUtils]: 56: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,532 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [186] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~j~0_23 v_main_~bufsize~0_11) 1 0) |v___VERIFIER_assert_#in~condInParam_9|) InVars {main_~bufsize~0=v_main_~bufsize~0_11, main_~j~0=v_main_~j~0_23} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_9|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,532 INFO L272 TraceCheckUtils]: 58: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [170] L48-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2444#true} is VALID [2022-04-15 00:32:52,532 INFO L290 TraceCheckUtils]: 59: Hoare triple {2444#true} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2444#true} is VALID [2022-04-15 00:32:52,532 INFO L290 TraceCheckUtils]: 60: Hoare triple {2444#true} [154] L18-->L18-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {2444#true} [160] L18-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2444#true} is VALID [2022-04-15 00:32:52,534 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {2444#true} {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [187] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_10| (ite (<= 0 v_main_~j~0_24) 1 0)) InVars {main_~j~0=v_main_~j~0_24} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_10|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0] {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,534 INFO L290 TraceCheckUtils]: 63: Hoare triple {2475#(<= (+ main_~j~0 4) main_~bufsize~0)} [171] L49-->L52: Formula: (and (= v_main_~i~0_19 (+ v_main_~i~0_20 1)) (= v_main_~j~0_15 (+ v_main_~j~0_16 1))) InVars {main_~i~0=v_main_~i~0_20, main_~j~0=v_main_~j~0_16} OutVars{main_~i~0=v_main_~i~0_19, main_#t~post6=|v_main_#t~post6_1|, main_~j~0=v_main_~j~0_15, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~j~0, main_~i~0, main_#t~post6, main_#t~post7] {2492#(<= (+ main_~j~0 3) main_~bufsize~0)} is VALID [2022-04-15 00:32:52,535 INFO L272 TraceCheckUtils]: 64: Hoare triple {2492#(<= (+ main_~j~0 3) main_~bufsize~0)} [175] L52-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~j~0_25 v_main_~bufsize~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_11|) InVars {main_~bufsize~0=v_main_~bufsize~0_12, main_~j~0=v_main_~j~0_25} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_11|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~j~0, main_~bufsize~0] {2493#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 00:32:52,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {2493#(not (= |__VERIFIER_assert_#in~cond| 0))} [150] __VERIFIER_assertENTRY-->L18: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2494#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 00:32:52,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {2494#(not (= __VERIFIER_assert_~cond 0))} [153] L18-->L19: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2445#false} is VALID [2022-04-15 00:32:52,536 INFO L290 TraceCheckUtils]: 67: Hoare triple {2445#false} [158] L19-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2445#false} is VALID [2022-04-15 00:32:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 00:32:52,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 00:32:52,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506533678] [2022-04-15 00:32:52,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506533678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 00:32:52,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 00:32:52,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 00:32:52,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225055309] [2022-04-15 00:32:52,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 00:32:52,539 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-04-15 00:32:52,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 00:32:52,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 00:32:52,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:52,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 00:32:52,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 00:32:52,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 00:32:52,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 00:32:52,573 INFO L87 Difference]: Start difference. First operand 71 states and 82 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 00:32:53,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,290 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2022-04-15 00:32:53,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 00:32:53,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 68 [2022-04-15 00:32:53,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 00:32:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 00:32:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 00:32:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 00:32:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2022-04-15 00:32:53,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2022-04-15 00:32:53,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 00:32:53,354 INFO L225 Difference]: With dead ends: 73 [2022-04-15 00:32:53,354 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 00:32:53,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-15 00:32:53,356 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 00:32:53,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 00:32:53,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 00:32:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 00:32:53,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 00:32:53,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:53,357 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:53,357 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:53,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,357 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:53,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:32:53,358 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 00:32:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 00:32:53,358 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 00:32:53,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:53,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 00:32:53,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 00:32:53,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 00:32:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 00:32:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 00:32:53,359 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2022-04-15 00:32:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 00:32:53,359 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 00:32:53,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-04-15 00:32:53,359 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 00:32:53,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 00:32:53,362 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 00:32:53,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 00:32:53,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 00:32:53,795 INFO L878 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-15 00:32:53,795 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:32:53,795 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:32:53,795 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 00:32:53,795 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 00:32:53,795 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 00:32:53,795 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 67) the Hoare annotation is: true [2022-04-15 00:32:53,796 INFO L882 garLoopResultBuilder]: For program point L31(line 31) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 24 67) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L878 garLoopResultBuilder]: At program point L34-2(lines 34 65) the Hoare annotation is: (and (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,796 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 24 67) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L882 garLoopResultBuilder]: For program point L34-3(lines 34 65) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 64) the Hoare annotation is: (and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,796 INFO L882 garLoopResultBuilder]: For program point L36(lines 36 63) no Hoare annotation was computed. [2022-04-15 00:32:53,796 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,796 INFO L878 garLoopResultBuilder]: At program point L56(lines 36 63) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,796 INFO L878 garLoopResultBuilder]: At program point L37-1(line 37) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,797 INFO L882 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,797 INFO L882 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,797 INFO L882 garLoopResultBuilder]: For program point L60(line 60) no Hoare annotation was computed. [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,797 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= 0 main_~j~0) (<= (+ 5 main_~j~0) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0) (<= (+ main_~i~0 2) main_~len~0)) [2022-04-15 00:32:53,798 INFO L882 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L46-1(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,798 INFO L882 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,798 INFO L882 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2022-04-15 00:32:53,798 INFO L878 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (and (<= (+ main_~i~0 1) main_~len~0) (<= 0 main_~j~0) (<= (+ main_~j~0 4) main_~bufsize~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,799 INFO L878 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~j~0 3) main_~bufsize~0) (<= 0 main_~j~0) (<= 0 main_~i~0) (<= (+ main_~limit~0 4) main_~bufsize~0)) [2022-04-15 00:32:53,799 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-15 00:32:53,799 INFO L882 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2022-04-15 00:32:53,799 INFO L882 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-04-15 00:32:53,799 INFO L882 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:32:53,799 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-04-15 00:32:53,799 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2022-04-15 00:32:53,802 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 00:32:53,803 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:32:53,806 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 00:32:53,807 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 00:32:53,810 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:32:53,810 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-15 00:32:53,810 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-04-15 00:32:53,810 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 00:32:53,810 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:32:53,814 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 00:32:53,815 INFO L163 areAnnotationChecker]: CFG has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 00:32:53,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:32:53 BasicIcfg [2022-04-15 00:32:53,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 00:32:53,825 INFO L158 Benchmark]: Toolchain (without parser) took 9350.82ms. Allocated memory was 201.3MB in the beginning and 314.6MB in the end (delta: 113.2MB). Free memory was 142.3MB in the beginning and 208.5MB in the end (delta: -66.2MB). Peak memory consumption was 47.4MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,826 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 00:32:53,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.09ms. Allocated memory was 201.3MB in the beginning and 262.1MB in the end (delta: 60.8MB). Free memory was 142.0MB in the beginning and 230.5MB in the end (delta: -88.5MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,826 INFO L158 Benchmark]: Boogie Preprocessor took 35.27ms. Allocated memory is still 262.1MB. Free memory was 230.5MB in the beginning and 229.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,826 INFO L158 Benchmark]: RCFGBuilder took 443.01ms. Allocated memory is still 262.1MB. Free memory was 229.0MB in the beginning and 213.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,827 INFO L158 Benchmark]: IcfgTransformer took 62.44ms. Allocated memory is still 262.1MB. Free memory was 213.8MB in the beginning and 211.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,827 INFO L158 Benchmark]: TraceAbstraction took 8459.53ms. Allocated memory was 262.1MB in the beginning and 314.6MB in the end (delta: 52.4MB). Free memory was 211.1MB in the beginning and 208.5MB in the end (delta: 2.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. [2022-04-15 00:32:53,829 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.13ms. Allocated memory is still 201.3MB. Free memory is still 158.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 335.09ms. Allocated memory was 201.3MB in the beginning and 262.1MB in the end (delta: 60.8MB). Free memory was 142.0MB in the beginning and 230.5MB in the end (delta: -88.5MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.27ms. Allocated memory is still 262.1MB. Free memory was 230.5MB in the beginning and 229.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 443.01ms. Allocated memory is still 262.1MB. Free memory was 229.0MB in the beginning and 213.8MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 62.44ms. Allocated memory is still 262.1MB. Free memory was 213.8MB in the beginning and 211.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 8459.53ms. Allocated memory was 262.1MB in the beginning and 314.6MB in the end (delta: 52.4MB). Free memory was 211.1MB in the beginning and 208.5MB in the end (delta: 2.6MB). Peak memory consumption was 55.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 272 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 254 mSDsluCounter, 454 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 497 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1453 IncrementalHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 497 mSolverCounterUnsat, 294 mSDtfsCounter, 1453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=7, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 55 PreInvPairs, 76 NumberOfFragments, 374 HoareAnnotationTreeSize, 55 FomulaSimplifications, 98 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 23 FomulaSimplificationsInter, 532 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 272 NumberOfCodeBlocks, 272 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 592 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 428/428 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: 35]: Loop Invariant Derived loop invariant: (0 <= j && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: (((i + 1 <= len && 0 <= j) && 5 + j <= bufsize) && 0 <= i) && limit + 4 <= bufsize - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 0 <= i && limit + 4 <= bufsize RESULT: Ultimate proved your program to be correct! [2022-04-15 00:32:53,865 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...