/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:52,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:52,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:52,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:52,560 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:52,561 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:52,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:52,563 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:52,565 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:52,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:52,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:52,567 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:52,567 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:52,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:52,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:52,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:52,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:52,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:52,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:52,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:52,581 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:52,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:52,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:52,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:52,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:52,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:52,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:52,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:52,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:52,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:52,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:52,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:52,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:52,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:52,591 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:52,592 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:52,592 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:52,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:52,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:52,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:52,594 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:52,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:52,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:52,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:52,616 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:52,617 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:52,617 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:52,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:52,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:52,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:52,618 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:52,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:52,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:52,619 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:52,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:52,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:52,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:52,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:52,620 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:52,620 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:56:52,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:52,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:52,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:52,878 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:52,878 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:52,880 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-1.i [2022-04-27 15:56:52,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac9f81a5/803c72700443488db6da732dddd58d02/FLAGfee48901f [2022-04-27 15:56:53,371 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:53,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i [2022-04-27 15:56:53,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac9f81a5/803c72700443488db6da732dddd58d02/FLAGfee48901f [2022-04-27 15:56:53,403 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac9f81a5/803c72700443488db6da732dddd58d02 [2022-04-27 15:56:53,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:53,408 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:53,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:53,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:53,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:53,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62df3745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53, skipping insertion in model container [2022-04-27 15:56:53,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:53,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:53,634 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-27 15:56:53,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:53,684 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:53,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-1.i[896,909] [2022-04-27 15:56:53,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:53,738 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:53,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53 WrapperNode [2022-04-27 15:56:53,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:53,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:53,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:53,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:53,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,757 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:53,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:53,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:53,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:53,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (1/1) ... [2022-04-27 15:56:53,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:53,821 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:56:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:56:53,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:53,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:53,857 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:53,857 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 15:56:53,858 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:53,858 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 15:56:53,858 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 15:56:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 15:56:53,859 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:53,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:56:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:53,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:53,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:53,925 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:53,927 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:54,164 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:54,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:54,175 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 15:56:54,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:54 BoogieIcfgContainer [2022-04-27 15:56:54,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:54,178 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:54,178 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:54,180 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:54,183 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:54" (1/1) ... [2022-04-27 15:56:54,185 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:54,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:54 BasicIcfg [2022-04-27 15:56:54,230 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:54,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:54,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:54,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:54,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:53" (1/4) ... [2022-04-27 15:56:54,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c89b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:54, skipping insertion in model container [2022-04-27 15:56:54,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:53" (2/4) ... [2022-04-27 15:56:54,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c89b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:54, skipping insertion in model container [2022-04-27 15:56:54,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:54" (3/4) ... [2022-04-27 15:56:54,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10c89b21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:54, skipping insertion in model container [2022-04-27 15:56:54,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:54" (4/4) ... [2022-04-27 15:56:54,237 INFO L111 eAbstractionObserver]: Analyzing ICFG string-1.iJordan [2022-04-27 15:56:54,249 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:54,250 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:54,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:54,289 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c6269b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@30e7a5d0 [2022-04-27 15:56:54,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:56:54,306 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:54,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:54,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1544634334, now seen corresponding path program 1 times [2022-04-27 15:56:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097020224] [2022-04-27 15:56:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:54,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:54,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:54,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 15:56:54,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:56:54,559 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:56:54,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:54,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {38#true} is VALID [2022-04-27 15:56:54,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:56:54,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:56:54,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#true} is VALID [2022-04-27 15:56:54,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {38#true} is VALID [2022-04-27 15:56:54,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {38#true} [133] L33-3-->L33-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {39#false} is VALID [2022-04-27 15:56:54,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {39#false} is VALID [2022-04-27 15:56:54,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} [141] L37-3-->L37-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {39#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {39#false} is VALID [2022-04-27 15:56:54,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {39#false} is VALID [2022-04-27 15:56:54,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} [148] L42-3-->L42-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {39#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {39#false} is VALID [2022-04-27 15:56:54,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} [153] L46-3-->L46-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {39#false} is VALID [2022-04-27 15:56:54,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {39#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {39#false} is VALID [2022-04-27 15:56:54,572 INFO L272 TraceCheckUtils]: 18: Hoare triple {39#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {39#false} is VALID [2022-04-27 15:56:54,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {39#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {39#false} is VALID [2022-04-27 15:56:54,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {39#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {39#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39#false} is VALID [2022-04-27 15:56:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:54,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:54,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097020224] [2022-04-27 15:56:54,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097020224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:54,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:54,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:54,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949906035] [2022-04-27 15:56:54,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:54,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 22 [2022-04-27 15:56:54,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:54,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:54,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:54,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:54,661 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:54,760 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 15:56:54,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:54,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 22 [2022-04-27 15:56:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:54,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 15:56:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-04-27 15:56:54,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-04-27 15:56:54,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:54,877 INFO L225 Difference]: With dead ends: 35 [2022-04-27 15:56:54,877 INFO L226 Difference]: Without dead ends: 28 [2022-04-27 15:56:54,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:54,881 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:54,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:54,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-27 15:56:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-27 15:56:54,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:54,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,913 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,913 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:54,916 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 15:56:54,916 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:56:54,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:54,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:54,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 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) Second operand 28 states. [2022-04-27 15:56:54,918 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 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) Second operand 28 states. [2022-04-27 15:56:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:54,924 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 15:56:54,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:56:54,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:54,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:54,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:54,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-04-27 15:56:54,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2022-04-27 15:56:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:54,930 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-04-27 15:56:54,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-27 15:56:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:56:54,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:54,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:54,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:54,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1694186334, now seen corresponding path program 1 times [2022-04-27 15:56:54,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:54,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146930218] [2022-04-27 15:56:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {165#true} is VALID [2022-04-27 15:56:55,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:56:55,011 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {165#true} {165#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:56:55,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {165#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:55,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {165#true} is VALID [2022-04-27 15:56:55,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:56:55,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:56:55,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {165#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {165#true} is VALID [2022-04-27 15:56:55,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {165#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {170#(= main_~i~0 0)} is VALID [2022-04-27 15:56:55,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {170#(= main_~i~0 0)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:56:55,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {166#false} is VALID [2022-04-27 15:56:55,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {166#false} is VALID [2022-04-27 15:56:55,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:56:55,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {166#false} is VALID [2022-04-27 15:56:55,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {166#false} is VALID [2022-04-27 15:56:55,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {166#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {166#false} is VALID [2022-04-27 15:56:55,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {166#false} is VALID [2022-04-27 15:56:55,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {166#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {166#false} is VALID [2022-04-27 15:56:55,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {166#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {166#false} is VALID [2022-04-27 15:56:55,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {166#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {166#false} is VALID [2022-04-27 15:56:55,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {166#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {166#false} is VALID [2022-04-27 15:56:55,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {166#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:56:55,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {166#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {166#false} is VALID [2022-04-27 15:56:55,017 INFO L272 TraceCheckUtils]: 20: Hoare triple {166#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {166#false} is VALID [2022-04-27 15:56:55,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {166#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {166#false} is VALID [2022-04-27 15:56:55,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {166#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:56:55,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {166#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {166#false} is VALID [2022-04-27 15:56:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:55,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:55,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146930218] [2022-04-27 15:56:55,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146930218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:55,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:55,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:56:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923514833] [2022-04-27 15:56:55,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-04-27 15:56:55,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:55,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:55,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:56:55,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:56:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:56:55,050 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:55,171 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:56:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:56:55,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 24 [2022-04-27 15:56:55,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:55,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 15:56:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2022-04-27 15:56:55,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 45 transitions. [2022-04-27 15:56:55,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:55,227 INFO L225 Difference]: With dead ends: 36 [2022-04-27 15:56:55,227 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 15:56:55,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:55,229 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:55,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 15:56:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-04-27 15:56:55,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:55,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,234 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,234 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:55,236 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:56:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 15:56:55,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:55,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:55,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 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) Second operand 36 states. [2022-04-27 15:56:55,237 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 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) Second operand 36 states. [2022-04-27 15:56:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:55,242 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 15:56:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 15:56:55,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:55,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:55,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:55,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:55,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-27 15:56:55,248 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 24 [2022-04-27 15:56:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:55,248 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-27 15:56:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-27 15:56:55,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:56:55,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:55,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:55,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:55,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:55,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:55,250 INFO L85 PathProgramCache]: Analyzing trace with hash 132080930, now seen corresponding path program 1 times [2022-04-27 15:56:55,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077957888] [2022-04-27 15:56:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:55,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:56:55,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,341 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:55,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:56:55,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,342 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {319#(= main_~i~0 0)} is VALID [2022-04-27 15:56:55,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {319#(= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {319#(= main_~i~0 0)} is VALID [2022-04-27 15:56:55,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {319#(= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {320#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:55,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= main_~i~0 1)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:56:55,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:56:55,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:56:55,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:56:55,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:56:55,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,350 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:56:55,351 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:56:55,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:56:55,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:56:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:55,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077957888] [2022-04-27 15:56:55,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077957888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:55,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668995757] [2022-04-27 15:56:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:55,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:55,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:55,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:56:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 15:56:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 15:56:55,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:55,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:55,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:56:55,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {340#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:55,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {340#(<= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {340#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:55,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {320#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:55,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= main_~i~0 1)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:56:55,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:56:55,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:56:55,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:56:55,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:56:55,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,596 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:56:55,597 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:56:55,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:56:55,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:56:55,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:55,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {315#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {315#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {315#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {315#false} is VALID [2022-04-27 15:56:55,732 INFO L272 TraceCheckUtils]: 24: Hoare triple {315#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {315#false} is VALID [2022-04-27 15:56:55,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {315#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {315#false} is VALID [2022-04-27 15:56:55,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {315#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {315#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {315#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {315#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {315#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {315#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {315#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {315#false} is VALID [2022-04-27 15:56:55,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {315#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {315#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {315#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {315#false} is VALID [2022-04-27 15:56:55,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {315#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {315#false} is VALID [2022-04-27 15:56:55,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {315#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {315#false} is VALID [2022-04-27 15:56:55,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {464#(< main_~i~0 5)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {315#false} is VALID [2022-04-27 15:56:55,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {468#(< main_~i~0 4)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {464#(< main_~i~0 5)} is VALID [2022-04-27 15:56:55,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {468#(< main_~i~0 4)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {468#(< main_~i~0 4)} is VALID [2022-04-27 15:56:55,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {468#(< main_~i~0 4)} is VALID [2022-04-27 15:56:55,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {314#true} is VALID [2022-04-27 15:56:55,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {314#true} is VALID [2022-04-27 15:56:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:56:55,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668995757] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:55,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:55,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 15:56:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578013028] [2022-04-27 15:56:55,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:55,759 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:56:55,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:55,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:55,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 15:56:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:55,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 15:56:55,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 15:56:55,796 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:56,144 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:56:56,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:56:56,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:56:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:56,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 15:56:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2022-04-27 15:56:56,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2022-04-27 15:56:56,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:56,242 INFO L225 Difference]: With dead ends: 58 [2022-04-27 15:56:56,242 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 15:56:56,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:56:56,244 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:56,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 42 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 15:56:56,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-27 15:56:56,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:56,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,248 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,249 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:56,251 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:56:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 15:56:56,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:56,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:56,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 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) Second operand 58 states. [2022-04-27 15:56:56,252 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 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) Second operand 58 states. [2022-04-27 15:56:56,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:56,255 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-04-27 15:56:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-27 15:56:56,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:56,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:56,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:56,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:56,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 15:56:56,257 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 28 [2022-04-27 15:56:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:56,257 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 15:56:56,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 15:56:56,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-27 15:56:56,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:56,259 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 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-27 15:56:56,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 15:56:56,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:56,476 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:56,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1964785826, now seen corresponding path program 2 times [2022-04-27 15:56:56,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:56,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098276802] [2022-04-27 15:56:56,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:56,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:56,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:56,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:56:56,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,613 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:56,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:56:56,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {721#(= main_~i~0 0)} is VALID [2022-04-27 15:56:56,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {721#(= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {721#(= main_~i~0 0)} is VALID [2022-04-27 15:56:56,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {721#(= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:56,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(<= main_~i~0 1)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {722#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:56,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {722#(<= main_~i~0 1)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:56,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(<= main_~i~0 2)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {723#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:56,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {723#(<= main_~i~0 2)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:56,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(<= main_~i~0 3)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {724#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:56,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(<= main_~i~0 3)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {725#(<= main_~i~0 4)} is VALID [2022-04-27 15:56:56,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {725#(<= main_~i~0 4)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {717#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {717#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 17: Hoare triple {717#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 18: Hoare triple {717#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {717#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {717#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {717#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {717#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {717#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {717#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {717#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {717#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {717#false} is VALID [2022-04-27 15:56:56,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {717#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {717#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 30: Hoare triple {717#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {717#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {717#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {717#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {717#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {717#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {717#false} is VALID [2022-04-27 15:56:56,623 INFO L272 TraceCheckUtils]: 36: Hoare triple {717#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {717#false} is VALID [2022-04-27 15:56:56,623 INFO L290 TraceCheckUtils]: 37: Hoare triple {717#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {717#false} is VALID [2022-04-27 15:56:56,623 INFO L290 TraceCheckUtils]: 38: Hoare triple {717#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,623 INFO L290 TraceCheckUtils]: 39: Hoare triple {717#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,623 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 15:56:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098276802] [2022-04-27 15:56:56,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098276802] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455873426] [2022-04-27 15:56:56,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 15:56:56,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:56,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:56,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:56:56,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 15:56:56,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 15:56:56,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 15:56:56,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 15:56:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:56,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:56,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {716#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {716#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {716#true} is VALID [2022-04-27 15:56:56,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {716#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {716#true} {716#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {716#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {716#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {716#true} is VALID [2022-04-27 15:56:56,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {716#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {716#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {716#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {716#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {716#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {716#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {716#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {716#true} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {716#true} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#true} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {716#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 19: Hoare triple {716#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,955 INFO L290 TraceCheckUtils]: 20: Hoare triple {716#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {716#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {716#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {716#true} is VALID [2022-04-27 15:56:56,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {716#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {716#true} is VALID [2022-04-27 15:56:56,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#true} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {716#true} is VALID [2022-04-27 15:56:56,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {716#true} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {716#true} is VALID [2022-04-27 15:56:56,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {716#true} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {716#true} is VALID [2022-04-27 15:56:56,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {716#true} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {716#true} is VALID [2022-04-27 15:56:56,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {716#true} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {716#true} is VALID [2022-04-27 15:56:56,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {716#true} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {820#(<= main_~nc_B~0 0)} is VALID [2022-04-27 15:56:56,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {820#(<= main_~nc_B~0 0)} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {820#(<= main_~nc_B~0 0)} is VALID [2022-04-27 15:56:56,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {820#(<= main_~nc_B~0 0)} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {820#(<= main_~nc_B~0 0)} is VALID [2022-04-27 15:56:56,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {820#(<= main_~nc_B~0 0)} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {830#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-27 15:56:56,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {830#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {830#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} is VALID [2022-04-27 15:56:56,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {830#(and (<= main_~nc_B~0 0) (<= 0 main_~j~0))} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {837#(= 1 main_~found~0)} is VALID [2022-04-27 15:56:56,961 INFO L272 TraceCheckUtils]: 36: Hoare triple {837#(= 1 main_~found~0)} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {841#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:56,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {841#(<= 1 |__VERIFIER_assert_#in~cond|)} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {845#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:56,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {845#(<= 1 __VERIFIER_assert_~cond)} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {717#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#false} is VALID [2022-04-27 15:56:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-27 15:56:56,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:56,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455873426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:56,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 15:56:56,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-04-27 15:56:56,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614151861] [2022-04-27 15:56:56,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:56,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 40 [2022-04-27 15:56:56,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:56,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:56,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:56,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 15:56:56,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:56,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 15:56:56,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:56:56,984 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:57,138 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2022-04-27 15:56:57,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:56:57,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 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 40 [2022-04-27 15:56:57,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-27 15:56:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-27 15:56:57,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-27 15:56:57,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:57,175 INFO L225 Difference]: With dead ends: 50 [2022-04-27 15:56:57,175 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 15:56:57,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-27 15:56:57,177 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:57,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 147 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:57,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 15:56:57,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 15:56:57,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:57,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,180 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,180 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:57,181 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 15:56:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 15:56:57,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:57,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:57,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 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) Second operand 44 states. [2022-04-27 15:56:57,181 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 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) Second operand 44 states. [2022-04-27 15:56:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:57,182 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-04-27 15:56:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 15:56:57,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:57,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:57,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:57,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:57,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-27 15:56:57,193 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2022-04-27 15:56:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:57,193 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-27 15:56:57,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-27 15:56:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-27 15:56:57,194 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:57,194 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:57,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 15:56:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 15:56:57,395 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:57,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash -319404770, now seen corresponding path program 1 times [2022-04-27 15:56:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:57,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081200784] [2022-04-27 15:56:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:57,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:57,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1037#true} is VALID [2022-04-27 15:56:57,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1037#true} {1037#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1037#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:57,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1037#true} is VALID [2022-04-27 15:56:57,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1037#true} {1037#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {1037#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {1037#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {1042#(= main_~i~0 0)} is VALID [2022-04-27 15:56:57,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {1042#(= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1042#(= main_~i~0 0)} is VALID [2022-04-27 15:56:57,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#(= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#(<= main_~i~0 1)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= main_~i~0 1)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= main_~i~0 2)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= main_~i~0 2)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#(<= main_~i~0 3)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(<= main_~i~0 3)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1046#(<= main_~i~0 4)} is VALID [2022-04-27 15:56:57,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(<= main_~i~0 4)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {1038#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {1038#false} is VALID [2022-04-27 15:56:57,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1038#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {1038#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {1038#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {1038#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {1038#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {1038#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {1038#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {1038#false} [158] L46-1-->L46-3: Formula: (and (= (+ v_main_~nc_B~0_4 1) v_main_~nc_B~0_3) (not (= |v_main_#t~mem9_5| 0))) InVars {main_~nc_B~0=v_main_~nc_B~0_4, main_#t~mem9=|v_main_#t~mem9_5|} OutVars{main_~nc_B~0=v_main_~nc_B~0_3, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~nc_B~0, main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {1038#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {1038#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {1038#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {1038#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L272 TraceCheckUtils]: 38: Hoare triple {1038#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L290 TraceCheckUtils]: 39: Hoare triple {1038#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {1038#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {1038#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 15:56:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081200784] [2022-04-27 15:56:57,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081200784] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147688878] [2022-04-27 15:56:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:57,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:57,514 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:56:57,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 15:56:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:57,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 15:56:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:57,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:57,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {1037#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1037#true} is VALID [2022-04-27 15:56:57,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1037#true} {1037#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {1037#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1037#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {1066#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:57,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(<= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1066#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:57,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#(<= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#(<= main_~i~0 1)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= main_~i~0 1)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= main_~i~0 2)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,740 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= main_~i~0 2)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#(<= main_~i~0 3)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(<= main_~i~0 3)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1046#(<= main_~i~0 4)} is VALID [2022-04-27 15:56:57,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(<= main_~i~0 4)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {1038#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {1038#false} is VALID [2022-04-27 15:56:57,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {1038#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,744 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,744 INFO L290 TraceCheckUtils]: 21: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 22: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 23: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 24: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 25: Hoare triple {1038#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {1038#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {1038#false} is VALID [2022-04-27 15:56:57,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {1038#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {1038#false} is VALID [2022-04-27 15:56:57,746 INFO L290 TraceCheckUtils]: 28: Hoare triple {1038#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {1038#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {1038#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {1038#false} is VALID [2022-04-27 15:56:57,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {1038#false} [158] L46-1-->L46-3: Formula: (and (= (+ v_main_~nc_B~0_4 1) v_main_~nc_B~0_3) (not (= |v_main_#t~mem9_5| 0))) InVars {main_~nc_B~0=v_main_~nc_B~0_4, main_#t~mem9=|v_main_#t~mem9_5|} OutVars{main_~nc_B~0=v_main_~nc_B~0_3, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~nc_B~0, main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {1038#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {1038#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L290 TraceCheckUtils]: 36: Hoare triple {1038#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L290 TraceCheckUtils]: 37: Hoare triple {1038#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {1038#false} is VALID [2022-04-27 15:56:57,747 INFO L272 TraceCheckUtils]: 38: Hoare triple {1038#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {1038#false} is VALID [2022-04-27 15:56:57,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {1038#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1038#false} is VALID [2022-04-27 15:56:57,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {1038#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {1038#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 15:56:57,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:57,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {1038#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L290 TraceCheckUtils]: 40: Hoare triple {1038#false} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {1038#false} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L272 TraceCheckUtils]: 38: Hoare triple {1038#false} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {1038#false} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {1038#false} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,926 INFO L290 TraceCheckUtils]: 35: Hoare triple {1038#false} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {1038#false} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {1038#false} [158] L46-1-->L46-3: Formula: (and (= (+ v_main_~nc_B~0_4 1) v_main_~nc_B~0_3) (not (= |v_main_#t~mem9_5| 0))) InVars {main_~nc_B~0=v_main_~nc_B~0_4, main_#t~mem9=|v_main_#t~mem9_5|} OutVars{main_~nc_B~0=v_main_~nc_B~0_3, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~nc_B~0, main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {1038#false} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {1038#false} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {1038#false} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {1038#false} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {1038#false} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {1038#false} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {1038#false} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {1038#false} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1038#false} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1038#false} is VALID [2022-04-27 15:56:57,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1038#false} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {1038#false} is VALID [2022-04-27 15:56:57,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {1038#false} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {1038#false} is VALID [2022-04-27 15:56:57,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {1046#(<= main_~i~0 4)} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {1038#false} is VALID [2022-04-27 15:56:57,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1045#(<= main_~i~0 3)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1046#(<= main_~i~0 4)} is VALID [2022-04-27 15:56:57,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {1045#(<= main_~i~0 3)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {1044#(<= main_~i~0 2)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1045#(<= main_~i~0 3)} is VALID [2022-04-27 15:56:57,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {1044#(<= main_~i~0 2)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {1043#(<= main_~i~0 1)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1044#(<= main_~i~0 2)} is VALID [2022-04-27 15:56:57,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1043#(<= main_~i~0 1)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#(<= main_~i~0 0)} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1043#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:57,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#(<= main_~i~0 0)} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1066#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:57,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {1037#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {1066#(<= main_~i~0 0)} is VALID [2022-04-27 15:56:57,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {1037#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,935 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1037#true} {1037#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {1037#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1037#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1037#true} is VALID [2022-04-27 15:56:57,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1037#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1037#true} is VALID [2022-04-27 15:56:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-27 15:56:57,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147688878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:57,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:57,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 9 [2022-04-27 15:56:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97735362] [2022-04-27 15:56:57,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:57,938 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 15:56:57,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:57,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:57,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:57,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 15:56:57,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:57,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 15:56:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-27 15:56:57,967 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:58,338 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-04-27 15:56:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:56:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-27 15:56:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 15:56:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2022-04-27 15:56:58,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2022-04-27 15:56:58,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:58,419 INFO L225 Difference]: With dead ends: 68 [2022-04-27 15:56:58,419 INFO L226 Difference]: Without dead ends: 68 [2022-04-27 15:56:58,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:56:58,420 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:58,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 47 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-27 15:56:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2022-04-27 15:56:58,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:58,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,424 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,425 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:58,427 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-04-27 15:56:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-27 15:56:58,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:58,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:58,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 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) Second operand 68 states. [2022-04-27 15:56:58,428 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 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) Second operand 68 states. [2022-04-27 15:56:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:58,430 INFO L93 Difference]: Finished difference Result 68 states and 83 transitions. [2022-04-27 15:56:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-27 15:56:58,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:58,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:58,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:58,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:58,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-04-27 15:56:58,432 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 42 [2022-04-27 15:56:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:58,433 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-04-27 15:56:58,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-27 15:56:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 15:56:58,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:58,434 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:58,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 15:56:58,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:58,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 18104734, now seen corresponding path program 2 times [2022-04-27 15:56:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:58,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451451313] [2022-04-27 15:56:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:58,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1562#true} is VALID [2022-04-27 15:56:58,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1562#true} {1562#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {1562#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:58,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1562#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1562#true} {1562#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {1562#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {1562#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {1562#true} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {1562#true} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {1562#true} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#true} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#true} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#true} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#true} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {1562#true} is VALID [2022-04-27 15:56:58,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#true} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1562#true} is VALID [2022-04-27 15:56:58,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#true} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {1567#(= main_~nc_B~0 0)} is VALID [2022-04-27 15:56:58,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {1567#(= main_~nc_B~0 0)} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1567#(= main_~nc_B~0 0)} is VALID [2022-04-27 15:56:58,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {1567#(= main_~nc_B~0 0)} [158] L46-1-->L46-3: Formula: (and (= (+ v_main_~nc_B~0_4 1) v_main_~nc_B~0_3) (not (= |v_main_#t~mem9_5| 0))) InVars {main_~nc_B~0=v_main_~nc_B~0_4, main_#t~mem9=|v_main_#t~mem9_5|} OutVars{main_~nc_B~0=v_main_~nc_B~0_3, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~nc_B~0, main_#t~mem9] {1568#(<= 1 main_~nc_B~0)} is VALID [2022-04-27 15:56:58,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {1568#(<= 1 main_~nc_B~0)} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1568#(<= 1 main_~nc_B~0)} is VALID [2022-04-27 15:56:58,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {1568#(<= 1 main_~nc_B~0)} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {1568#(<= 1 main_~nc_B~0)} is VALID [2022-04-27 15:56:58,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {1568#(<= 1 main_~nc_B~0)} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1569#(and (<= 1 main_~nc_B~0) (= (+ (* (- 1) main_~i~0) main_~j~0) 0) (= main_~i~0 0))} is VALID [2022-04-27 15:56:58,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {1569#(and (<= 1 main_~nc_B~0) (= (+ (* (- 1) main_~i~0) main_~j~0) 0) (= main_~i~0 0))} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1570#(<= (+ main_~j~0 1) main_~nc_B~0)} is VALID [2022-04-27 15:56:58,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {1570#(<= (+ main_~j~0 1) main_~nc_B~0)} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {1571#(= 0 main_~found~0)} is VALID [2022-04-27 15:56:58,875 INFO L272 TraceCheckUtils]: 42: Hoare triple {1571#(= 0 main_~found~0)} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {1572#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:58,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {1572#(not (= |__VERIFIER_assert_#in~cond| 0))} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1573#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:58,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {1573#(not (= __VERIFIER_assert_~cond 0))} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1563#false} is VALID [2022-04-27 15:56:58,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {1563#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1563#false} is VALID [2022-04-27 15:56:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-27 15:56:58,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:58,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451451313] [2022-04-27 15:56:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451451313] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:58,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665676594] [2022-04-27 15:56:58,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 15:56:58,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:58,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:58,883 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 15:56:58,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 15:56:58,949 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 15:56:58,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 15:56:58,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 15:56:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:58,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:59,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {1562#true} [127] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {1562#true} [129] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_10| 1))) (and (= (select .cse0 1) 0) (= (select |v_#length_4| 2) 11) (= 2 (select |v_#length_4| 1)) (= (select |v_#valid_16| 1) 1) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_16| 2) 1) (= 48 (select .cse0 0)) (= |v_#NULL.base_1| 0) (= (select |v_#valid_16| 0) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_10|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_16|, #memory_int=|v_#memory_int_10|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_4|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1562#true} is VALID [2022-04-27 15:56:59,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {1562#true} [132] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1562#true} {1562#true} [173] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {1562#true} [128] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {1562#true} [131] mainENTRY-->L33-3: Formula: (let ((.cse0 (store |v_#valid_3| |v_main_~#string_A~0.base_1| 1))) (and (= (select .cse0 |v_main_~#string_B~0.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_main_~#string_A~0.base_1|) (= |v_#valid_1| (store .cse0 |v_main_~#string_B~0.base_2| 1)) (= v_main_~i~0_1 0) (= (select |v_#valid_3| |v_main_~#string_A~0.base_1|) 0) (= |v_main_~#string_A~0.offset_1| 0) (not (= |v_main_~#string_B~0.base_2| 0)) (= v_main_~found~0_1 0) (= |v_main_~#string_B~0.offset_2| 0) (not (= |v_main_~#string_A~0.base_1| 0)) (= |v_#length_1| (store (store |v_#length_3| |v_main_~#string_A~0.base_1| 5) |v_main_~#string_B~0.base_2| 5)) (< |v_#StackHeapBarrier_1| |v_main_~#string_B~0.base_2|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_3|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_2|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_2|, main_~j~0=v_main_~j~0_1, main_~nc_B~0=v_main_~nc_B~0_5, main_~found~0=v_main_~found~0_1, main_~#string_A~0.offset=|v_main_~#string_A~0.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_1|, #valid=|v_#valid_1|, main_~i~0=v_main_~i~0_1, #length=|v_#length_1|, main_~nc_A~0=v_main_~nc_A~0_1} AuxVars[] AssignedVars[main_~#string_B~0.base, main_~found~0, main_~#string_A~0.offset, main_~#string_B~0.offset, main_~#string_A~0.base, main_~j~0, #valid, main_~i~0, #length, main_~nc_A~0, main_~nc_B~0] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {1562#true} [135] L33-3-->L33-2: Formula: (and (= (store |v_#memory_int_3| |v_main_~#string_A~0.base_4| (store (select |v_#memory_int_3| |v_main_~#string_A~0.base_4|) (+ |v_main_~#string_A~0.offset_4| v_main_~i~0_5) |v_main_#t~nondet2_2|)) |v_#memory_int_2|) (<= 0 (+ |v_main_#t~nondet2_2| 128)) (<= |v_main_#t~nondet2_2| 127) (< v_main_~i~0_5 5)) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_3|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_4|, #memory_int=|v_#memory_int_2|, main_~i~0=v_main_~i~0_5, main_~#string_A~0.base=|v_main_~#string_A~0.base_4|} AuxVars[] AssignedVars[main_#t~nondet2, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {1562#true} [137] L33-2-->L33-3: Formula: (= v_main_~i~0_6 (+ v_main_~i~0_7 1)) InVars {main_~i~0=v_main_~i~0_7} OutVars{main_~i~0=v_main_~i~0_6, main_#t~post1=|v_main_#t~post1_1|} AuxVars[] AssignedVars[main_#t~post1, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {1562#true} [134] L33-3-->L33-4: Formula: (not (< v_main_~i~0_4 5)) InVars {main_~i~0=v_main_~i~0_4} OutVars{main_~i~0=v_main_~i~0_4} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 17: Hoare triple {1562#true} [136] L33-4-->L35: Formula: (= |v_main_#t~mem3_1| (select (select |v_#memory_int_5| |v_main_~#string_A~0.base_6|) (+ |v_main_~#string_A~0.offset_6| 4))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_6|, #memory_int=|v_#memory_int_5|, main_#t~mem3=|v_main_#t~mem3_1|, main_~#string_A~0.base=|v_main_~#string_A~0.base_6|} AuxVars[] AssignedVars[main_#t~mem3] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {1562#true} [139] L35-->L37-3: Formula: (and (= v_main_~i~0_14 0) (= |v_main_#t~mem3_5| 0)) InVars {main_#t~mem3=|v_main_#t~mem3_5|} OutVars{main_~i~0=v_main_~i~0_14} AuxVars[] AssignedVars[main_#t~mem3, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {1562#true} [143] L37-3-->L37-2: Formula: (and (<= 0 (+ |v_main_#t~nondet5_2| 128)) (< v_main_~i~0_16 5) (<= |v_main_#t~nondet5_2| 127) (= (store |v_#memory_int_7| |v_main_~#string_B~0.base_10| (store (select |v_#memory_int_7| |v_main_~#string_B~0.base_10|) (+ v_main_~i~0_16 |v_main_~#string_B~0.offset_10|) |v_main_#t~nondet5_2|)) |v_#memory_int_6|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_7|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_10|, #memory_int=|v_#memory_int_6|, main_~i~0=v_main_~i~0_16, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_10|} AuxVars[] AssignedVars[main_#t~nondet5, #memory_int] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 28: Hoare triple {1562#true} [145] L37-2-->L37-3: Formula: (= v_main_~i~0_17 (+ v_main_~i~0_18 1)) InVars {main_~i~0=v_main_~i~0_18} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_17} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 29: Hoare triple {1562#true} [142] L37-3-->L37-4: Formula: (not (< v_main_~i~0_15 5)) InVars {main_~i~0=v_main_~i~0_15} OutVars{main_~i~0=v_main_~i~0_15} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 30: Hoare triple {1562#true} [144] L37-4-->L39: Formula: (= |v_main_#t~mem6_1| (select (select |v_#memory_int_8| |v_main_~#string_B~0.base_11|) (+ |v_main_~#string_B~0.offset_11| 4))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_11|, #memory_int=|v_#memory_int_8|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_11|, main_#t~mem6=|v_main_#t~mem6_1|} AuxVars[] AssignedVars[main_#t~mem6] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 31: Hoare triple {1562#true} [147] L39-->L42-3: Formula: (and (= v_main_~nc_A~0_6 0) (= |v_main_#t~mem6_5| 0)) InVars {main_#t~mem6=|v_main_#t~mem6_5|} OutVars{main_~nc_A~0=v_main_~nc_A~0_6} AuxVars[] AssignedVars[main_#t~mem6, main_~nc_A~0] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {1562#true} [149] L42-3-->L42-1: Formula: (= |v_main_#t~mem7_1| (select (select |v_#memory_int_9| |v_main_~#string_A~0.base_13|) (+ |v_main_~#string_A~0.offset_13| v_main_~nc_A~0_7))) InVars {main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} OutVars{main_~#string_A~0.offset=|v_main_~#string_A~0.offset_13|, main_#t~mem7=|v_main_#t~mem7_1|, #memory_int=|v_#memory_int_9|, main_~nc_A~0=v_main_~nc_A~0_7, main_~#string_A~0.base=|v_main_~#string_A~0.base_13|} AuxVars[] AssignedVars[main_#t~mem7] {1562#true} is VALID [2022-04-27 15:56:59,151 INFO L290 TraceCheckUtils]: 33: Hoare triple {1562#true} [151] L42-1-->L42-4: Formula: (= |v_main_#t~mem7_3| 0) InVars {main_#t~mem7=|v_main_#t~mem7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem7] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 34: Hoare triple {1562#true} [150] L42-4-->L46-3: Formula: (= v_main_~nc_B~0_1 0) InVars {} OutVars{main_~nc_B~0=v_main_~nc_B~0_1} AuxVars[] AssignedVars[main_~nc_B~0] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 35: Hoare triple {1562#true} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {1562#true} [158] L46-1-->L46-3: Formula: (and (= (+ v_main_~nc_B~0_4 1) v_main_~nc_B~0_3) (not (= |v_main_#t~mem9_5| 0))) InVars {main_~nc_B~0=v_main_~nc_B~0_4, main_#t~mem9=|v_main_#t~mem9_5|} OutVars{main_~nc_B~0=v_main_~nc_B~0_3, main_#t~post10=|v_main_#t~post10_1|} AuxVars[] AssignedVars[main_#t~post10, main_~nc_B~0, main_#t~mem9] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {1562#true} [154] L46-3-->L46-1: Formula: (= |v_main_#t~mem9_1| (select (select |v_#memory_int_1| |v_main_~#string_B~0.base_1|) (+ |v_main_~#string_B~0.offset_1| v_main_~nc_B~0_2))) InVars {main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_~nc_B~0=v_main_~nc_B~0_2} OutVars{main_~#string_B~0.base=|v_main_~#string_B~0.base_1|, #memory_int=|v_#memory_int_1|, main_~#string_B~0.offset=|v_main_~#string_B~0.offset_1|, main_#t~mem9=|v_main_#t~mem9_1|, main_~nc_B~0=v_main_~nc_B~0_2} AuxVars[] AssignedVars[main_#t~mem9] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {1562#true} [157] L46-1-->L46-4: Formula: (= |v_main_#t~mem9_3| 0) InVars {main_#t~mem9=|v_main_#t~mem9_3|} OutVars{} AuxVars[] AssignedVars[main_#t~mem9] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 39: Hoare triple {1562#true} [156] L46-4-->L55-2: Formula: (and (= v_main_~j~0_2 0) (<= v_main_~nc_A~0_3 v_main_~nc_B~0_7) (= v_main_~i~0_3 v_main_~j~0_2)) InVars {main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7} OutVars{main_~i~0=v_main_~i~0_3, main_~nc_A~0=v_main_~nc_A~0_3, main_~nc_B~0=v_main_~nc_B~0_7, main_~j~0=v_main_~j~0_2} AuxVars[] AssignedVars[main_~j~0, main_~i~0] {1562#true} is VALID [2022-04-27 15:56:59,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {1562#true} [160] L55-2-->L53-2: Formula: (or (not (< v_main_~j~0_3 v_main_~nc_B~0_8)) (not (< v_main_~i~0_8 v_main_~nc_A~0_4))) InVars {main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} OutVars{main_~i~0=v_main_~i~0_8, main_~nc_A~0=v_main_~nc_A~0_4, main_~nc_B~0=v_main_~nc_B~0_8, main_~j~0=v_main_~j~0_3} AuxVars[] AssignedVars[] {1562#true} is VALID [2022-04-27 15:56:59,153 INFO L290 TraceCheckUtils]: 41: Hoare triple {1562#true} [162] L53-2-->L69: Formula: (= v_main_~found~0_2 (ite (< v_main_~nc_B~0_10 (+ v_main_~j~0_9 1)) 1 0)) InVars {main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} OutVars{main_~found~0=v_main_~found~0_2, main_~nc_B~0=v_main_~nc_B~0_10, main_~j~0=v_main_~j~0_9} AuxVars[] AssignedVars[main_~found~0] {1701#(or (= 1 main_~found~0) (= 0 main_~found~0))} is VALID [2022-04-27 15:56:59,154 INFO L272 TraceCheckUtils]: 42: Hoare triple {1701#(or (= 1 main_~found~0) (= 0 main_~found~0))} [165] L69-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (or (= v_main_~found~0_4 0) (= v_main_~found~0_4 1)) 1 0)) InVars {main_~found~0=v_main_~found~0_4} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~found~0, __VERIFIER_assert_#in~cond] {1705#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 15:56:59,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {1705#(<= 1 |__VERIFIER_assert_#in~cond|)} [167] __VERIFIER_assertENTRY-->L19: Formula: (= v___VERIFIER_assert_~cond_3 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1709#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 15:56:59,155 INFO L290 TraceCheckUtils]: 44: Hoare triple {1709#(<= 1 __VERIFIER_assert_~cond)} [168] L19-->L20: Formula: (= v___VERIFIER_assert_~cond_1 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[] {1563#false} is VALID [2022-04-27 15:56:59,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {1563#false} [170] L20-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1563#false} is VALID [2022-04-27 15:56:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-27 15:56:59,155 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 15:56:59,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665676594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:59,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 15:56:59,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-04-27 15:56:59,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808034754] [2022-04-27 15:56:59,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:59,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 46 [2022-04-27 15:56:59,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:59,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:59,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:59,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:56:59,176 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:59,246 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-27 15:56:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:56:59,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 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 46 [2022-04-27 15:56:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:59,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 15:56:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-27 15:56:59,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-27 15:56:59,275 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-27 15:56:59,275 INFO L225 Difference]: With dead ends: 46 [2022-04-27 15:56:59,275 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:56:59,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-27 15:56:59,276 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:59,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 93 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:56:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:56:59,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:59,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:59,278 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:59,278 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:59,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:59,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:59,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:59,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:56:59,278 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:56:59,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:59,279 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:59,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:59,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:59,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:59,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:56:59,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-04-27 15:56:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:59,279 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:56:59,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:59,282 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:59,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 15:56:59,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:59,498 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-27 15:56:59,499 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:59,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:59 BasicIcfg [2022-04-27 15:56:59,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:59,502 INFO L158 Benchmark]: Toolchain (without parser) took 6094.88ms. Allocated memory was 179.3MB in the beginning and 252.7MB in the end (delta: 73.4MB). Free memory was 125.8MB in the beginning and 135.6MB in the end (delta: -9.8MB). Peak memory consumption was 63.2MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,503 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 179.3MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:59,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.37ms. Allocated memory was 179.3MB in the beginning and 252.7MB in the end (delta: 73.4MB). Free memory was 125.6MB in the beginning and 222.7MB in the end (delta: -97.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,503 INFO L158 Benchmark]: Boogie Preprocessor took 40.13ms. Allocated memory is still 252.7MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,503 INFO L158 Benchmark]: RCFGBuilder took 396.79ms. Allocated memory is still 252.7MB. Free memory was 220.6MB in the beginning and 206.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,504 INFO L158 Benchmark]: IcfgTransformer took 52.46ms. Allocated memory is still 252.7MB. Free memory was 206.1MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,504 INFO L158 Benchmark]: TraceAbstraction took 5269.92ms. Allocated memory is still 252.7MB. Free memory was 203.4MB in the beginning and 135.6MB in the end (delta: 67.8MB). Peak memory consumption was 67.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:59,505 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.12ms. Allocated memory is still 179.3MB. Free memory is still 142.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.37ms. Allocated memory was 179.3MB in the beginning and 252.7MB in the end (delta: 73.4MB). Free memory was 125.6MB in the beginning and 222.7MB in the end (delta: -97.1MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.13ms. Allocated memory is still 252.7MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 396.79ms. Allocated memory is still 252.7MB. Free memory was 220.6MB in the beginning and 206.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * IcfgTransformer took 52.46ms. Allocated memory is still 252.7MB. Free memory was 206.1MB in the beginning and 204.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 5269.92ms. Allocated memory is still 252.7MB. Free memory was 203.4MB in the beginning and 135.6MB in the end (delta: 67.8MB). Peak memory consumption was 67.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: 20]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 6, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 236 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 232 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 317 IncrementalHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 174 mSDtfsCounter, 317 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 227 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 358 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 6 NumberOfNonLiveVariables, 527 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 207/276 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:56:59,534 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...