/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:44:42,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:44:42,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:44:42,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:44:42,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:44:42,647 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:44:42,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:44:42,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:44:42,653 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:44:42,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:44:42,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:44:42,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:44:42,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:44:42,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:44:42,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:44:42,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:44:42,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:44:42,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:44:42,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:44:42,670 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:44:42,671 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:44:42,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:44:42,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:44:42,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:44:42,674 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:44:42,679 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:44:42,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:44:42,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:44:42,680 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:44:42,680 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:44:42,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:44:42,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:44:42,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:44:42,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:44:42,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:44:42,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:44:42,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:44:42,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:44:42,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:44:42,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:44:42,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:44:42,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:44:42,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:44:42,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:44:42,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:44:42,696 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:44:42,696 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:44:42,697 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:44:42,697 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:44:42,697 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:44:42,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:44:42,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:44:42,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:44:42,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:44:42,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:44:42,699 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 05:44:42,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:44:42,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:44:42,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:44:42,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:44:42,919 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:44:42,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-15 05:44:42,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c1f0bbd/b31e7d9c36b7406b88aed7b80de2e12b/FLAGf3a0b26f5 [2022-04-15 05:44:43,340 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:44:43,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-15 05:44:43,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c1f0bbd/b31e7d9c36b7406b88aed7b80de2e12b/FLAGf3a0b26f5 [2022-04-15 05:44:43,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80c1f0bbd/b31e7d9c36b7406b88aed7b80de2e12b [2022-04-15 05:44:43,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:44:43,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:44:43,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:44:43,777 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:44:43,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:44:43,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:44:43" (1/1) ... [2022-04-15 05:44:43,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21296925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:43, skipping insertion in model container [2022-04-15 05:44:43,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:44:43" (1/1) ... [2022-04-15 05:44:43,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:44:43,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:44:43,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-04-15 05:44:44,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:44:44,013 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:44:44,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-04-15 05:44:44,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:44:44,048 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:44:44,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44 WrapperNode [2022-04-15 05:44:44,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:44:44,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:44:44,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:44:44,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:44:44,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,072 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,077 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:44:44,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:44:44,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:44:44,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:44:44,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (1/1) ... [2022-04-15 05:44:44,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:44:44,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:44,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 05:44:44,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2022-04-15 05:44:44,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:44:44,145 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2022-04-15 05:44:44,146 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2022-04-15 05:44:44,147 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:44:44,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:44:44,221 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:44:44,222 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:44:44,450 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:44:44,455 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:44:44,455 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-15 05:44:44,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:44:44 BoogieIcfgContainer [2022-04-15 05:44:44,456 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:44:44,457 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:44:44,458 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:44:44,460 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:44:44,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:44:43" (1/3) ... [2022-04-15 05:44:44,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14364752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:44:44, skipping insertion in model container [2022-04-15 05:44:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:44:44" (2/3) ... [2022-04-15 05:44:44,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14364752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:44:44, skipping insertion in model container [2022-04-15 05:44:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:44:44" (3/3) ... [2022-04-15 05:44:44,462 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-15 05:44:44,465 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:44:44,465 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:44:44,504 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:44:44,513 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 05:44:44,513 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:44:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 05:44:44,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 05:44:44,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:44,539 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:44,540 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:44,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash -541205821, now seen corresponding path program 1 times [2022-04-15 05:44:44,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:44,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873369011] [2022-04-15 05:44:44,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:44:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash -541205821, now seen corresponding path program 2 times [2022-04-15 05:44:44,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:44,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248212774] [2022-04-15 05:44:44,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:44,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:44,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {58#true} is VALID [2022-04-15 05:44:44,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-15 05:44:44,742 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-15 05:44:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-15 05:44:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:44,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {58#true} is VALID [2022-04-15 05:44:44,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-15 05:44:44,755 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-15 05:44:44,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:44,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {58#true} is VALID [2022-04-15 05:44:44,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-15 05:44:44,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-15 05:44:44,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret24 := main(); {58#true} is VALID [2022-04-15 05:44:44,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {58#true} is VALID [2022-04-15 05:44:44,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#true} assume !true; {59#false} is VALID [2022-04-15 05:44:44,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {59#false} is VALID [2022-04-15 05:44:44,759 INFO L272 TraceCheckUtils]: 8: Hoare triple {59#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {59#false} is VALID [2022-04-15 05:44:44,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {59#false} is VALID [2022-04-15 05:44:44,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2022-04-15 05:44:44,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {59#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {59#false} is VALID [2022-04-15 05:44:44,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch5; {59#false} is VALID [2022-04-15 05:44:44,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-15 05:44:44,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {59#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {59#false} is VALID [2022-04-15 05:44:44,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {59#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {59#false} is VALID [2022-04-15 05:44:44,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2022-04-15 05:44:44,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-15 05:44:44,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short18 := 0 < ~j~0; {59#false} is VALID [2022-04-15 05:44:44,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#false} assume !#t~short18; {59#false} is VALID [2022-04-15 05:44:44,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {59#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {59#false} is VALID [2022-04-15 05:44:44,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2022-04-15 05:44:44,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2022-04-15 05:44:44,763 INFO L272 TraceCheckUtils]: 23: Hoare triple {59#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {58#true} is VALID [2022-04-15 05:44:44,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {58#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {58#true} is VALID [2022-04-15 05:44:44,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-15 05:44:44,764 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-15 05:44:44,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret20.base, #t~ret20.offset; {59#false} is VALID [2022-04-15 05:44:44,764 INFO L272 TraceCheckUtils]: 28: Hoare triple {59#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {59#false} is VALID [2022-04-15 05:44:44,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2022-04-15 05:44:44,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2022-04-15 05:44:44,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2022-04-15 05:44:44,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248212774] [2022-04-15 05:44:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248212774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:44,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:44,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:44:44,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:44,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873369011] [2022-04-15 05:44:44,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873369011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:44,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:44,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:44:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265532721] [2022-04-15 05:44:44,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:44,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-04-15 05:44:44,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:44,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:44,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:44,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:44:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:44:44,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:44:44,845 INFO L87 Difference]: Start difference. First operand has 55 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:44,996 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-04-15 05:44:44,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:44:44,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-04-15 05:44:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-15 05:44:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-15 05:44:45,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-04-15 05:44:45,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:45,142 INFO L225 Difference]: With dead ends: 102 [2022-04-15 05:44:45,142 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 05:44:45,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-15 05:44:45,148 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:45,149 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 68 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:44:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 05:44:45,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 05:44:45,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:45,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,187 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,189 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:45,193 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-15 05:44:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 05:44:45,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:45,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:45,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 05:44:45,196 INFO L87 Difference]: Start difference. First operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 47 states. [2022-04-15 05:44:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:45,199 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-15 05:44:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 05:44:45,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:45,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:45,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:45,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:45,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-04-15 05:44:45,208 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 32 [2022-04-15 05:44:45,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:45,208 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-04-15 05:44:45,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 57 transitions. [2022-04-15 05:44:45,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-15 05:44:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 05:44:45,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:45,256 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:45,256 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:44:45,256 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1555699344, now seen corresponding path program 1 times [2022-04-15 05:44:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:45,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [504583006] [2022-04-15 05:44:45,257 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:44:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1555699344, now seen corresponding path program 2 times [2022-04-15 05:44:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:45,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770171638] [2022-04-15 05:44:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {461#true} is VALID [2022-04-15 05:44:45,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 05:44:45,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {461#true} #158#return; {461#true} is VALID [2022-04-15 05:44:45,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-15 05:44:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {461#true} is VALID [2022-04-15 05:44:45,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 05:44:45,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {462#false} #154#return; {462#false} is VALID [2022-04-15 05:44:45,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:45,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {461#true} is VALID [2022-04-15 05:44:45,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 05:44:45,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {461#true} {461#true} #158#return; {461#true} is VALID [2022-04-15 05:44:45,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {461#true} call #t~ret24 := main(); {461#true} is VALID [2022-04-15 05:44:45,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {466#(= main_~i~1 0)} is VALID [2022-04-15 05:44:45,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(= main_~i~1 0)} assume !(~i~1 < 8); {462#false} is VALID [2022-04-15 05:44:45,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {462#false} is VALID [2022-04-15 05:44:45,350 INFO L272 TraceCheckUtils]: 8: Hoare triple {462#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {462#false} is VALID [2022-04-15 05:44:45,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {462#false} is VALID [2022-04-15 05:44:45,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#false} assume !(~str.base == 0 && ~str.offset == 0); {462#false} is VALID [2022-04-15 05:44:45,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {462#false} is VALID [2022-04-15 05:44:45,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#false} assume #t~switch5; {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {462#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {462#false} is VALID [2022-04-15 05:44:45,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#false} ~j~0 := ~i~0 - 1; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#false} #t~short15 := 0 < ~j~0; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {462#false} assume !#t~short15; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {462#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {462#false} #t~short18 := 0 < ~j~0; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {462#false} assume !#t~short18; {462#false} is VALID [2022-04-15 05:44:45,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {462#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {462#false} is VALID [2022-04-15 05:44:45,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {462#false} assume ~start~0 <= ~j~0; {462#false} is VALID [2022-04-15 05:44:45,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {462#false} assume !(1 + (~j~0 - ~start~0) >= 2); {462#false} is VALID [2022-04-15 05:44:45,354 INFO L272 TraceCheckUtils]: 27: Hoare triple {462#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {461#true} is VALID [2022-04-15 05:44:45,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {461#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {461#true} is VALID [2022-04-15 05:44:45,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-15 05:44:45,355 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {461#true} {462#false} #154#return; {462#false} is VALID [2022-04-15 05:44:45,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {462#false} havoc #t~ret20.base, #t~ret20.offset; {462#false} is VALID [2022-04-15 05:44:45,355 INFO L272 TraceCheckUtils]: 32: Hoare triple {462#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {462#false} is VALID [2022-04-15 05:44:45,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {462#false} ~cond := #in~cond; {462#false} is VALID [2022-04-15 05:44:45,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {462#false} assume 0 == ~cond; {462#false} is VALID [2022-04-15 05:44:45,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-04-15 05:44:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:45,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770171638] [2022-04-15 05:44:45,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770171638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:45,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:45,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:44:45,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:45,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [504583006] [2022-04-15 05:44:45,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [504583006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:45,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:45,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:44:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737808292] [2022-04-15 05:44:45,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:45,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-15 05:44:45,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:45,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:45,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:44:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:45,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:44:45,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:44:45,398 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:45,577 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-04-15 05:44:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:44:45,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-15 05:44:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 05:44:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 05:44:45,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 05:44:45,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:45,667 INFO L225 Difference]: With dead ends: 88 [2022-04-15 05:44:45,667 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 05:44:45,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-15 05:44:45,668 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:45,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 60 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:44:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 05:44:45,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-15 05:44:45,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:45,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,674 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,674 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:45,676 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-15 05:44:45,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-15 05:44:45,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:45,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:45,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 05:44:45,677 INFO L87 Difference]: Start difference. First operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 05:44:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:45,678 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-15 05:44:45,678 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-15 05:44:45,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:45,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:45,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:45,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-04-15 05:44:45,680 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 36 [2022-04-15 05:44:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:45,680 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-04-15 05:44:45,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:45,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 58 transitions. [2022-04-15 05:44:45,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-15 05:44:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:44:45,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:45,726 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:45,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:44:45,727 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:45,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1615735470, now seen corresponding path program 1 times [2022-04-15 05:44:45,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:45,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1531739749] [2022-04-15 05:44:45,746 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:45,746 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:45,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1615735470, now seen corresponding path program 2 times [2022-04-15 05:44:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:45,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374812528] [2022-04-15 05:44:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-15 05:44:45,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-15 05:44:45,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-15 05:44:45,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 05:44:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {845#true} is VALID [2022-04-15 05:44:45,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-15 05:44:45,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {845#true} {846#false} #154#return; {846#false} is VALID [2022-04-15 05:44:45,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:45,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-15 05:44:45,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-15 05:44:45,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-15 05:44:45,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret24 := main(); {845#true} is VALID [2022-04-15 05:44:45,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {850#(= main_~i~1 0)} is VALID [2022-04-15 05:44:45,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {850#(= main_~i~1 0)} is VALID [2022-04-15 05:44:45,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {851#(<= main_~i~1 1)} is VALID [2022-04-15 05:44:45,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~i~1 1)} assume !(~i~1 < 8); {846#false} is VALID [2022-04-15 05:44:45,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {846#false} is VALID [2022-04-15 05:44:45,800 INFO L272 TraceCheckUtils]: 10: Hoare triple {846#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {846#false} is VALID [2022-04-15 05:44:45,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {846#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {846#false} is VALID [2022-04-15 05:44:45,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} assume !(~str.base == 0 && ~str.offset == 0); {846#false} is VALID [2022-04-15 05:44:45,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume #t~switch5; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {846#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {846#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 18: Hoare triple {846#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {846#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {846#false} ~j~0 := ~i~0 - 1; {846#false} is VALID [2022-04-15 05:44:45,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {846#false} #t~short15 := 0 < ~j~0; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {846#false} assume !#t~short15; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {846#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {846#false} #t~short18 := 0 < ~j~0; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {846#false} assume !#t~short18; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {846#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {846#false} assume ~start~0 <= ~j~0; {846#false} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {846#false} assume !(1 + (~j~0 - ~start~0) >= 2); {846#false} is VALID [2022-04-15 05:44:45,802 INFO L272 TraceCheckUtils]: 29: Hoare triple {846#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {845#true} is VALID [2022-04-15 05:44:45,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {845#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {845#true} is VALID [2022-04-15 05:44:45,803 INFO L290 TraceCheckUtils]: 31: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-15 05:44:45,803 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {845#true} {846#false} #154#return; {846#false} is VALID [2022-04-15 05:44:45,803 INFO L290 TraceCheckUtils]: 33: Hoare triple {846#false} havoc #t~ret20.base, #t~ret20.offset; {846#false} is VALID [2022-04-15 05:44:45,803 INFO L272 TraceCheckUtils]: 34: Hoare triple {846#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {846#false} is VALID [2022-04-15 05:44:45,803 INFO L290 TraceCheckUtils]: 35: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-04-15 05:44:45,803 INFO L290 TraceCheckUtils]: 36: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-04-15 05:44:45,803 INFO L290 TraceCheckUtils]: 37: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-04-15 05:44:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:45,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374812528] [2022-04-15 05:44:45,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374812528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:45,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288152277] [2022-04-15 05:44:45,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:45,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:45,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:45,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:44:45,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 05:44:45,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:44:45,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:45,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-15 05:44:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:45,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:45,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-15 05:44:45,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-15 05:44:45,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret24 := main(); {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {845#true} is VALID [2022-04-15 05:44:45,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#true} assume !(~i~1 < 8); {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {845#true} is VALID [2022-04-15 05:44:45,982 INFO L272 TraceCheckUtils]: 10: Hoare triple {845#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#true} assume !(~str.base == 0 && ~str.offset == 0); {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#true} assume #t~switch5; {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {845#true} is VALID [2022-04-15 05:44:45,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#true} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#true} ~j~0 := ~i~0 - 1; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {845#true} #t~short15 := 0 < ~j~0; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {845#true} assume !#t~short15; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {845#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {845#true} is VALID [2022-04-15 05:44:45,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#true} #t~short18 := 0 < ~j~0; {845#true} is VALID [2022-04-15 05:44:45,984 INFO L290 TraceCheckUtils]: 25: Hoare triple {845#true} assume !#t~short18; {934#(not |parse_expression_list_#t~short18|)} is VALID [2022-04-15 05:44:45,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {934#(not |parse_expression_list_#t~short18|)} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {846#false} is VALID [2022-04-15 05:44:45,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {846#false} assume ~start~0 <= ~j~0; {846#false} is VALID [2022-04-15 05:44:45,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {846#false} assume !(1 + (~j~0 - ~start~0) >= 2); {846#false} is VALID [2022-04-15 05:44:45,984 INFO L272 TraceCheckUtils]: 29: Hoare triple {846#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {846#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {846#false} assume true; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {846#false} {846#false} #154#return; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {846#false} havoc #t~ret20.base, #t~ret20.offset; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L272 TraceCheckUtils]: 34: Hoare triple {846#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 35: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 36: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-04-15 05:44:45,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-04-15 05:44:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:44:45,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:44:45,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288152277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:45,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:44:45,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-15 05:44:45,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1531739749] [2022-04-15 05:44:45,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1531739749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:45,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:45,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:44:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991079838] [2022-04-15 05:44:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:45,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:45,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:46,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:46,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:44:46,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:46,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:44:46,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:44:46,013 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:46,064 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-15 05:44:46,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:44:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-15 05:44:46,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-15 05:44:46,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-04-15 05:44:46,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:46,129 INFO L225 Difference]: With dead ends: 84 [2022-04-15 05:44:46,129 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 05:44:46,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 05:44:46,130 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:46,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:44:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 05:44:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 05:44:46,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:46,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:46,135 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:46,135 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:46,136 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-15 05:44:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-15 05:44:46,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:46,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:46,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 05:44:46,137 INFO L87 Difference]: Start difference. First operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 49 states. [2022-04-15 05:44:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:46,138 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-15 05:44:46,138 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-15 05:44:46,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:46,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:46,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:46,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-15 05:44:46,140 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2022-04-15 05:44:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:46,140 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-15 05:44:46,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:46,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 59 transitions. [2022-04-15 05:44:46,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-15 05:44:46,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:44:46,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:46,183 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:46,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:44:46,396 WARN L460 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-15 05:44:46,396 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:46,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:46,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1357570032, now seen corresponding path program 1 times [2022-04-15 05:44:46,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:46,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931366177] [2022-04-15 05:44:46,402 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:46,402 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:46,402 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1357570032, now seen corresponding path program 2 times [2022-04-15 05:44:46,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:46,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637092036] [2022-04-15 05:44:46,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:46,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:46,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-15 05:44:46,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:44:46,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-15 05:44:46,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 05:44:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:46,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {1334#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1334#true} is VALID [2022-04-15 05:44:46,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:44:46,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1335#false} #154#return; {1335#false} is VALID [2022-04-15 05:44:46,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:46,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-15 05:44:46,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:44:46,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-15 05:44:46,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret24 := main(); {1334#true} is VALID [2022-04-15 05:44:46,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1339#(= main_~i~1 0)} is VALID [2022-04-15 05:44:46,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1339#(= main_~i~1 0)} is VALID [2022-04-15 05:44:46,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1339#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1340#(<= main_~i~1 1)} is VALID [2022-04-15 05:44:46,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= main_~i~1 1)} assume !(~i~1 < 8); {1335#false} is VALID [2022-04-15 05:44:46,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1335#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1335#false} is VALID [2022-04-15 05:44:46,455 INFO L272 TraceCheckUtils]: 10: Hoare triple {1335#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1335#false} is VALID [2022-04-15 05:44:46,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1335#false} is VALID [2022-04-15 05:44:46,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#false} assume !(~str.base == 0 && ~str.offset == 0); {1335#false} is VALID [2022-04-15 05:44:46,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {1335#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#false} assume #t~switch5; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 15: Hoare triple {1335#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {1335#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {1335#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {1335#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {1335#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {1335#false} ~j~0 := ~i~0 - 1; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {1335#false} #t~short15 := 0 < ~j~0; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {1335#false} assume !#t~short15; {1335#false} is VALID [2022-04-15 05:44:46,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {1335#false} #t~short18 := 0 < ~j~0; {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !#t~short18; {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {1335#false} assume ~start~0 <= ~j~0; {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1335#false} is VALID [2022-04-15 05:44:46,457 INFO L272 TraceCheckUtils]: 29: Hoare triple {1335#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1334#true} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {1334#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1334#true} is VALID [2022-04-15 05:44:46,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:44:46,457 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1334#true} {1335#false} #154#return; {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} havoc #t~ret20.base, #t~ret20.offset; {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L272 TraceCheckUtils]: 34: Hoare triple {1335#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 05:44:46,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:46,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:46,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637092036] [2022-04-15 05:44:46,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637092036] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:46,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81852796] [2022-04-15 05:44:46,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:46,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:46,465 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:44:46,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 05:44:46,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:44:46,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:46,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:44:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:46,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:46,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-15 05:44:46,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-15 05:44:46,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-15 05:44:46,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-15 05:44:46,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret24 := main(); {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {1334#true} assume !(~i~1 < 8); {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {1334#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1334#true} is VALID [2022-04-15 05:44:46,978 INFO L272 TraceCheckUtils]: 10: Hoare triple {1334#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1334#true} is VALID [2022-04-15 05:44:46,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-15 05:44:46,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-15 05:44:46,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch5; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1407#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:46,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {1407#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short15 := 0 < ~j~0; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short18 := 0 < ~j~0; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:46,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1335#false} is VALID [2022-04-15 05:44:46,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1335#false} is VALID [2022-04-15 05:44:46,999 INFO L272 TraceCheckUtils]: 29: Hoare triple {1335#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1335#false} is VALID [2022-04-15 05:44:46,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {1335#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {1335#false} assume true; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1335#false} {1335#false} #154#return; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} havoc #t~ret20.base, #t~ret20.offset; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L272 TraceCheckUtils]: 34: Hoare triple {1335#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-15 05:44:47,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-15 05:44:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:44:47,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:44:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81852796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:44:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-15 05:44:47,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:47,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931366177] [2022-04-15 05:44:47,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931366177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:47,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:47,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:44:47,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263926594] [2022-04-15 05:44:47,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:47,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:47,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:47,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:47,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:47,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:44:47,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:47,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:44:47,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:44:47,034 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:47,337 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2022-04-15 05:44:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:44:47,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-15 05:44:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-15 05:44:47,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2022-04-15 05:44:47,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:47,415 INFO L225 Difference]: With dead ends: 129 [2022-04-15 05:44:47,415 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 05:44:47,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:44:47,416 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:47,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:44:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 05:44:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-04-15 05:44:47,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:47,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:47,462 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:47,463 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:47,465 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-15 05:44:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-15 05:44:47,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:47,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:47,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-15 05:44:47,467 INFO L87 Difference]: Start difference. First operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-15 05:44:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:47,469 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-15 05:44:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-15 05:44:47,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:47,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:47,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:47,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-15 05:44:47,471 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2022-04-15 05:44:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:47,471 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-15 05:44:47,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:47,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 68 transitions. [2022-04-15 05:44:47,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:47,519 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-15 05:44:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:44:47,519 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:47,519 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:47,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 05:44:47,734 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 05:44:47,735 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1248453522, now seen corresponding path program 1 times [2022-04-15 05:44:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:47,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247964646] [2022-04-15 05:44:47,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:47,740 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:47,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:47,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1248453522, now seen corresponding path program 2 times [2022-04-15 05:44:47,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:47,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025501259] [2022-04-15 05:44:47,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:47,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:47,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-15 05:44:47,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-15 05:44:47,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-15 05:44:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-15 05:44:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:47,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {1988#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1988#true} is VALID [2022-04-15 05:44:47,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-15 05:44:47,789 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1988#true} {1989#false} #154#return; {1989#false} is VALID [2022-04-15 05:44:47,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:47,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-15 05:44:47,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-15 05:44:47,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-15 05:44:47,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret24 := main(); {1988#true} is VALID [2022-04-15 05:44:47,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {1988#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1993#(= main_~i~1 0)} is VALID [2022-04-15 05:44:47,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {1993#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1993#(= main_~i~1 0)} is VALID [2022-04-15 05:44:47,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1993#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1994#(<= main_~i~1 1)} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {1994#(<= main_~i~1 1)} assume !(~i~1 < 8); {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L272 TraceCheckUtils]: 10: Hoare triple {1989#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1989#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~str.base == 0 && ~str.offset == 0); {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {1989#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {1989#false} assume #t~switch5; {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {1989#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1989#false} is VALID [2022-04-15 05:44:47,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {1989#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !(34 == #t~mem10);havoc #t~mem10; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {1989#false} ~j~0 := ~i~0 - 1; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#false} #t~short15 := 0 < ~j~0; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !#t~short15; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {1989#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {1989#false} #t~short18 := 0 < ~j~0; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {1989#false} assume !#t~short18; {1989#false} is VALID [2022-04-15 05:44:47,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {1989#false} assume ~start~0 <= ~j~0; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L272 TraceCheckUtils]: 29: Hoare triple {1989#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1988#true} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {1988#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1988#true} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-15 05:44:47,794 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1988#true} {1989#false} #154#return; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {1989#false} havoc #t~ret20.base, #t~ret20.offset; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L272 TraceCheckUtils]: 34: Hoare triple {1989#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2022-04-15 05:44:47,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2022-04-15 05:44:47,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:44:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:47,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025501259] [2022-04-15 05:44:47,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025501259] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:47,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96571392] [2022-04-15 05:44:47,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:47,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:47,796 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-15 05:44:47,823 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-15 05:44:47,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:44:47,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:47,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:44:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:47,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:48,091 INFO L272 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret24 := main(); {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1988#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {1988#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1988#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {1988#true} assume !(~i~1 < 8); {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {1988#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1988#true} is VALID [2022-04-15 05:44:48,092 INFO L272 TraceCheckUtils]: 10: Hoare triple {1988#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1988#true} is VALID [2022-04-15 05:44:48,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1988#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-15 05:44:48,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-15 05:44:48,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch5; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem10);havoc #t~mem10; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-15 05:44:48,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short15 := 0 < ~j~0; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short18 := 0 < ~j~0; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-15 05:44:48,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1989#false} is VALID [2022-04-15 05:44:48,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1989#false} is VALID [2022-04-15 05:44:48,101 INFO L272 TraceCheckUtils]: 29: Hoare triple {1989#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1989#false} is VALID [2022-04-15 05:44:48,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {1989#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {1989#false} assume true; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1989#false} {1989#false} #154#return; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {1989#false} havoc #t~ret20.base, #t~ret20.offset; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L272 TraceCheckUtils]: 34: Hoare triple {1989#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2022-04-15 05:44:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:44:48,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:44:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96571392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:48,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:44:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 05:44:48,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:48,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247964646] [2022-04-15 05:44:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247964646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:48,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:44:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939278960] [2022-04-15 05:44:48,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:48,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:48,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:48,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:48,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:48,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:44:48,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:44:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:44:48,126 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:48,364 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2022-04-15 05:44:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:44:48,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-15 05:44:48,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-04-15 05:44:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-04-15 05:44:48,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2022-04-15 05:44:48,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:48,447 INFO L225 Difference]: With dead ends: 118 [2022-04-15 05:44:48,447 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 05:44:48,447 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:44:48,448 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:48,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 153 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:44:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 05:44:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-04-15 05:44:48,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:48,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:48,482 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:48,482 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:48,484 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-15 05:44:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-04-15 05:44:48,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:48,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:48,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-15 05:44:48,484 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-15 05:44:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:48,486 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-15 05:44:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-04-15 05:44:48,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:48,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:48,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:48,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:48,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-15 05:44:48,487 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 38 [2022-04-15 05:44:48,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:48,488 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-15 05:44:48,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:48,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-15 05:44:48,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-15 05:44:48,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 05:44:48,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:48,531 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:48,548 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-15 05:44:48,746 WARN L460 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-15 05:44:48,746 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:48,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:48,747 INFO L85 PathProgramCache]: Analyzing trace with hash 237631538, now seen corresponding path program 1 times [2022-04-15 05:44:48,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:48,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42059747] [2022-04-15 05:44:48,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:48,751 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:48,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:48,751 INFO L85 PathProgramCache]: Analyzing trace with hash 237631538, now seen corresponding path program 2 times [2022-04-15 05:44:48,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:48,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801421724] [2022-04-15 05:44:48,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:48,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:48,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:48,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-15 05:44:48,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 05:44:48,786 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-15 05:44:48,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 05:44:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:48,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {2589#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2589#true} is VALID [2022-04-15 05:44:48,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 05:44:48,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2590#false} #154#return; {2590#false} is VALID [2022-04-15 05:44:48,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:48,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-15 05:44:48,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 05:44:48,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-15 05:44:48,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret24 := main(); {2589#true} is VALID [2022-04-15 05:44:48,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2594#(= main_~i~1 0)} is VALID [2022-04-15 05:44:48,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {2594#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {2594#(= main_~i~1 0)} is VALID [2022-04-15 05:44:48,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {2594#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {2595#(<= main_~i~1 1)} is VALID [2022-04-15 05:44:48,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {2595#(<= main_~i~1 1)} assume !(~i~1 < 8); {2590#false} is VALID [2022-04-15 05:44:48,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {2590#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2590#false} is VALID [2022-04-15 05:44:48,792 INFO L272 TraceCheckUtils]: 10: Hoare triple {2590#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2590#false} is VALID [2022-04-15 05:44:48,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {2590#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {2590#false} assume !(~str.base == 0 && ~str.offset == 0); {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !#t~switch5; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} havoc #t~mem4;havoc #t~switch5; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} assume !!(0 != #t~mem2);havoc #t~mem2; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume #t~switch5; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2590#false} is VALID [2022-04-15 05:44:48,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} ~j~0 := ~i~0 - 1; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} #t~short15 := 0 < ~j~0; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#false} assume !#t~short15; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} #t~short18 := 0 < ~j~0; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !#t~short18; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#false} assume ~start~0 <= ~j~0; {2590#false} is VALID [2022-04-15 05:44:48,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2589#true} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {2589#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2589#true} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 05:44:48,795 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2589#true} {2590#false} #154#return; {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {2590#false} havoc #t~ret20.base, #t~ret20.offset; {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L272 TraceCheckUtils]: 39: Hoare triple {2590#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-15 05:44:48,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 05:44:48,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:44:48,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801421724] [2022-04-15 05:44:48,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801421724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:48,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553895803] [2022-04-15 05:44:48,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:48,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:48,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:48,797 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-15 05:44:48,798 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-15 05:44:48,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:44:48,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:48,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:44:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:48,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:49,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-15 05:44:49,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret24 := main(); {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume !(~i~1 < 8); {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2589#true} is VALID [2022-04-15 05:44:49,052 INFO L272 TraceCheckUtils]: 10: Hoare triple {2589#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2589#true} is VALID [2022-04-15 05:44:49,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} havoc #t~mem4;havoc #t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem2);havoc #t~mem2; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume #t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {2676#(<= 1 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2676#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {2676#(<= 1 parse_expression_list_~start~0)} is VALID [2022-04-15 05:44:49,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {2676#(<= 1 parse_expression_list_~start~0)} #t~short15 := 0 < ~j~0; {2683#(and (<= 1 parse_expression_list_~start~0) (or (and (not (< 0 parse_expression_list_~j~0)) (not |parse_expression_list_#t~short15|)) (and |parse_expression_list_#t~short15| (< 0 parse_expression_list_~j~0))))} is VALID [2022-04-15 05:44:49,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {2683#(and (<= 1 parse_expression_list_~start~0) (or (and (not (< 0 parse_expression_list_~j~0)) (not |parse_expression_list_#t~short15|)) (and |parse_expression_list_#t~short15| (< 0 parse_expression_list_~j~0))))} assume !#t~short15; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-15 05:44:49,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-15 05:44:49,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short18 := 0 < ~j~0; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-15 05:44:49,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short18; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-15 05:44:49,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-15 05:44:49,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {2590#false} is VALID [2022-04-15 05:44:49,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2590#false} is VALID [2022-04-15 05:44:49,064 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2590#false} is VALID [2022-04-15 05:44:49,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {2590#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2590#false} is VALID [2022-04-15 05:44:49,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {2590#false} assume true; {2590#false} is VALID [2022-04-15 05:44:49,064 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2590#false} {2590#false} #154#return; {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {2590#false} havoc #t~ret20.base, #t~ret20.offset; {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L272 TraceCheckUtils]: 39: Hoare triple {2590#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-15 05:44:49,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:44:49,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:44:49,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553895803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:49,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:44:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-15 05:44:49,066 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:49,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42059747] [2022-04-15 05:44:49,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42059747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:49,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:49,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:44:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547690903] [2022-04-15 05:44:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:49,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:44:49,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:49,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:49,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:49,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:44:49,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:49,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:44:49,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:44:49,091 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:49,446 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2022-04-15 05:44:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:44:49,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:44:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-04-15 05:44:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-04-15 05:44:49,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 177 transitions. [2022-04-15 05:44:49,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:49,576 INFO L225 Difference]: With dead ends: 142 [2022-04-15 05:44:49,576 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 05:44:49,577 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:44:49,578 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:49,578 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 205 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:44:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 05:44:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2022-04-15 05:44:49,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:49,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:49,657 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:49,657 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:49,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:49,660 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-04-15 05:44:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-04-15 05:44:49,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:49,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:49,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-15 05:44:49,661 INFO L87 Difference]: Start difference. First operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-15 05:44:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:49,663 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-04-15 05:44:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-04-15 05:44:49,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:49,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:49,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:49,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 05:44:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-04-15 05:44:49,666 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 43 [2022-04-15 05:44:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:49,666 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-04-15 05:44:49,667 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:49,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 91 transitions. [2022-04-15 05:44:49,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:49,735 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-15 05:44:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 05:44:49,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:44:49,736 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:44:49,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 05:44:49,951 WARN L460 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-15 05:44:49,952 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:44:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:44:49,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312204, now seen corresponding path program 1 times [2022-04-15 05:44:49,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:49,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993855145] [2022-04-15 05:44:49,956 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:44:49,956 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:44:49,957 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:44:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312204, now seen corresponding path program 2 times [2022-04-15 05:44:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:44:49,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55299668] [2022-04-15 05:44:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:44:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:44:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:44:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:50,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-15 05:44:50,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-15 05:44:50,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-15 05:44:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:50,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-15 05:44:50,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3362#true} {3363#false} #154#return; {3363#false} is VALID [2022-04-15 05:44:50,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} call ULTIMATE.init(); {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:44:50,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-15 05:44:50,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-15 05:44:50,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} call #t~ret24 := main(); {3362#true} is VALID [2022-04-15 05:44:50,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3367#(= main_~i~1 0)} is VALID [2022-04-15 05:44:50,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {3367#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {3367#(= main_~i~1 0)} is VALID [2022-04-15 05:44:50,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {3367#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {3368#(<= main_~i~1 1)} is VALID [2022-04-15 05:44:50,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {3368#(<= main_~i~1 1)} assume !(~i~1 < 8); {3363#false} is VALID [2022-04-15 05:44:50,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3363#false} is VALID [2022-04-15 05:44:50,009 INFO L272 TraceCheckUtils]: 10: Hoare triple {3363#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3363#false} is VALID [2022-04-15 05:44:50,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {3363#false} assume !(~str.base == 0 && ~str.offset == 0); {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {3363#false} assume !#t~switch5; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {3363#false} havoc #t~mem4;havoc #t~switch5; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {3363#false} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {3363#false} assume !!(0 != #t~mem2);havoc #t~mem2; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {3363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {3363#false} assume #t~switch5; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {3363#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {3363#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {3363#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {3363#false} is VALID [2022-04-15 05:44:50,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {3363#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {3363#false} assume !(34 == #t~mem10);havoc #t~mem10; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {3363#false} ~j~0 := ~i~0 - 1; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {3363#false} #t~short15 := 0 < ~j~0; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {3363#false} assume !#t~short15; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {3363#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {3363#false} #t~short18 := 0 < ~j~0; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 30: Hoare triple {3363#false} assume !#t~short18; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {3363#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 32: Hoare triple {3363#false} assume ~start~0 <= ~j~0; {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {3363#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3363#false} is VALID [2022-04-15 05:44:50,011 INFO L272 TraceCheckUtils]: 34: Hoare triple {3363#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3362#true} is VALID [2022-04-15 05:44:50,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-15 05:44:50,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,012 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3362#true} {3363#false} #154#return; {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {3363#false} havoc #t~ret20.base, #t~ret20.offset; {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L272 TraceCheckUtils]: 39: Hoare triple {3363#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {3363#false} ~cond := #in~cond; {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {3363#false} assume 0 == ~cond; {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} assume !false; {3363#false} is VALID [2022-04-15 05:44:50,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 05:44:50,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:44:50,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55299668] [2022-04-15 05:44:50,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55299668] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:44:50,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567506309] [2022-04-15 05:44:50,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:44:50,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:50,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:44:50,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:44:50,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 05:44:50,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:44:50,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:44:50,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:44:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:44:50,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:44:50,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} call ULTIMATE.init(); {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} call #t~ret24 := main(); {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {3362#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {3362#true} is VALID [2022-04-15 05:44:50,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} assume !(~i~1 < 8); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L272 TraceCheckUtils]: 10: Hoare triple {3362#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {3362#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#true} assume !(~str.base == 0 && ~str.offset == 0); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {3362#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#true} assume !#t~switch5; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#true} havoc #t~mem4;havoc #t~switch5; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#true} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#true} assume !!(0 != #t~mem2);havoc #t~mem2; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {3362#true} assume #t~switch5; {3362#true} is VALID [2022-04-15 05:44:50,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {3362#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {3362#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} assume !(34 == #t~mem10);havoc #t~mem10; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {3362#true} ~j~0 := ~i~0 - 1; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {3362#true} #t~short15 := 0 < ~j~0; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {3362#true} assume !#t~short15; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {3362#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {3362#true} #t~short18 := 0 < ~j~0; {3362#true} is VALID [2022-04-15 05:44:50,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {3362#true} assume !#t~short18; {3362#true} is VALID [2022-04-15 05:44:50,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {3362#true} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {3362#true} is VALID [2022-04-15 05:44:50,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {3362#true} assume ~start~0 <= ~j~0; {3362#true} is VALID [2022-04-15 05:44:50,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {3362#true} assume !(1 + (~j~0 - ~start~0) >= 2); {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-15 05:44:50,228 INFO L272 TraceCheckUtils]: 34: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3362#true} is VALID [2022-04-15 05:44:50,228 INFO L290 TraceCheckUtils]: 35: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-15 05:44:50,228 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-15 05:44:50,228 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3362#true} {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} #154#return; {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-15 05:44:50,229 INFO L290 TraceCheckUtils]: 38: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} havoc #t~ret20.base, #t~ret20.offset; {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-15 05:44:50,229 INFO L272 TraceCheckUtils]: 39: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:44:50,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {3494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:44:50,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {3498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3363#false} is VALID [2022-04-15 05:44:50,230 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} assume !false; {3363#false} is VALID [2022-04-15 05:44:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:44:50,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:44:50,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1567506309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:50,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:44:50,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 05:44:50,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:44:50,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993855145] [2022-04-15 05:44:50,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993855145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:44:50,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:44:50,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:44:50,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447042190] [2022-04-15 05:44:50,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:44:50,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:44:50,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:44:50,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:50,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:50,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:44:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:44:50,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:44:50,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:44:50,263 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:50,462 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 05:44:50,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:44:50,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-15 05:44:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:44:50,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 05:44:50,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 05:44:50,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 05:44:50,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:50,505 INFO L225 Difference]: With dead ends: 73 [2022-04-15 05:44:50,505 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 05:44:50,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:44:50,507 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:44:50,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 161 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:44:50,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 05:44:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 05:44:50,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:44:50,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:44:50,508 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:44:50,508 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:44:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:50,508 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:44:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:44:50,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:50,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:50,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:44:50,508 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 05:44:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:44:50,509 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 05:44:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:44:50,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:50,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:44:50,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:44:50,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:44:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 05:44:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 05:44:50,509 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-04-15 05:44:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:44:50,509 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 05:44:50,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 05:44:50,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 05:44:50,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:44:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 05:44:50,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:44:50,512 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 05:44:50,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 05:44:50,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:44:50,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 05:44:50,922 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 05:44:50,922 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 05:44:50,922 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 05:44:50,922 INFO L885 garLoopResultBuilder]: At program point r_strncpyFINAL(line 42) the Hoare annotation is: true [2022-04-15 05:44:50,922 INFO L885 garLoopResultBuilder]: At program point r_strncpyEXIT(line 42) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point r_strncpyENTRY(line 42) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 87 96) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 87 96) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L90-2(lines 90 92) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L90-3(lines 90 92) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L90-4(lines 90 92) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 87 96) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L878 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-15 05:44:50,923 INFO L878 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L73(lines 73 75) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L65(lines 65 83) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L70-2(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2022-04-15 05:44:50,923 INFO L885 garLoopResultBuilder]: At program point L70-4(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L70-6(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point parse_expression_listFINAL(lines 58 86) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L878 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0) (<= (+ parse_expression_list_~j~0 1) 0)) [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L70-8(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L70-9(line 70) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point parse_expression_listENTRY(lines 58 86) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L71-2(line 71) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L71-4(lines 65 83) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L67-3(line 67) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L67-5(line 67) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L63-1(lines 63 84) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L67-6(line 67) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L63-2(lines 63 84) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point parse_expression_listEXIT(lines 58 86) the Hoare annotation is: true [2022-04-15 05:44:50,924 INFO L885 garLoopResultBuilder]: At program point L63-4(lines 63 84) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point L63-5(lines 63 84) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L72(lines 72 81) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point L68-2(line 68) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 05:44:50,925 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 05:44:50,925 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 05:44:50,926 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 05:44:50,928 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-15 05:44:50,936 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 05:44:50,939 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:44:50,939 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 05:44:50,941 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 05:44:50,948 INFO L163 areAnnotationChecker]: CFG has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 05:44:50,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 05:44:50 BoogieIcfgContainer [2022-04-15 05:44:50,955 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 05:44:50,955 INFO L158 Benchmark]: Toolchain (without parser) took 7181.13ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 141.1MB in the beginning and 258.7MB in the end (delta: -117.6MB). Peak memory consumption was 107.6MB. Max. memory is 8.0GB. [2022-04-15 05:44:50,956 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 05:44:50,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.96ms. Allocated memory is still 188.7MB. Free memory was 140.8MB in the beginning and 165.3MB in the end (delta: -24.5MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-15 05:44:50,956 INFO L158 Benchmark]: Boogie Preprocessor took 39.27ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 163.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 05:44:50,956 INFO L158 Benchmark]: RCFGBuilder took 367.67ms. Allocated memory is still 188.7MB. Free memory was 163.0MB in the beginning and 144.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-04-15 05:44:50,956 INFO L158 Benchmark]: TraceAbstraction took 6497.19ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 144.4MB in the beginning and 258.7MB in the end (delta: -114.3MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. [2022-04-15 05:44:50,957 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.96ms. Allocated memory is still 188.7MB. Free memory was 140.8MB in the beginning and 165.3MB in the end (delta: -24.5MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.27ms. Allocated memory is still 188.7MB. Free memory was 165.3MB in the beginning and 163.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 367.67ms. Allocated memory is still 188.7MB. Free memory was 163.0MB in the beginning and 144.8MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 6497.19ms. Allocated memory was 188.7MB in the beginning and 280.0MB in the end (delta: 91.2MB). Free memory was 144.4MB in the beginning and 258.7MB in the end (delta: -114.3MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 956 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 597 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 359 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 171 PreInvPairs, 276 NumberOfFragments, 126 HoareAnnotationTreeSize, 171 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 55 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 58]: Procedure Contract for parse_expression_list Derived contract for procedure parse_expression_list: 1 - ProcedureContractResult [Line: 42]: Procedure Contract for r_strncpy Derived contract for procedure r_strncpy: 1 - ProcedureContractResult [Line: 87]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 05:44:50,989 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...