/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:21:19,968 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:21:19,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:21:20,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:21:20,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:21:20,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:21:20,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:21:20,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:21:20,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:21:20,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:21:20,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:21:20,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:21:20,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:21:20,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:21:20,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:21:20,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:21:20,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:21:20,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:21:20,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:21:20,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:21:20,021 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:21:20,022 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:21:20,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:21:20,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:21:20,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:21:20,027 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:21:20,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:21:20,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:21:20,028 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:21:20,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:21:20,029 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:21:20,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:21:20,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:21:20,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:21:20,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:21:20,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:21:20,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:21:20,033 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:21:20,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:21:20,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:21:20,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:21:20,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:21:20,036 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:21:20,054 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:21:20,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:21:20,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:21:20,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:21:20,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:21:20,056 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:21:20,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:21:20,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:21:20,057 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:21:20,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:21:20,057 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:21:20,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:21:20,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:21:20,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:21:20,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:21:20,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:21:20,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:21:20,059 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:21:20,059 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:21:20,059 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:21:20,060 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:21:20,060 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:21:20,060 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:21:20,060 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:21:20,061 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:20,061 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:21:20,061 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:21:20,061 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:21:20,062 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:21:20,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:21:20,062 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:21:20,062 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:21:20,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:21:20,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:21:20,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:21:20,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:21:20,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:21:20,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:21:20,285 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:21:20,286 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-27 10:21:20,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c931b5a70/64d261a464f84236a56be8d344ac884e/FLAG7211740b3 [2022-04-27 10:21:20,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:21:20,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-27 10:21:20,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c931b5a70/64d261a464f84236a56be8d344ac884e/FLAG7211740b3 [2022-04-27 10:21:21,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c931b5a70/64d261a464f84236a56be8d344ac884e [2022-04-27 10:21:21,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:21:21,144 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:21:21,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:21,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:21:21,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:21:21,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16216e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21, skipping insertion in model container [2022-04-27 10:21:21,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:21:21,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:21:21,298 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-27 10:21:21,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:21,336 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:21:21,344 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-27 10:21:21,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:21:21,375 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:21:21,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21 WrapperNode [2022-04-27 10:21:21,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:21:21,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:21:21,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:21:21,377 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:21:21,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:21:21,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:21:21,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:21:21,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:21:21,429 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (1/1) ... [2022-04-27 10:21:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:21:21,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:21,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:21:21,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:21:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:21:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:21:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:21:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:21:21,489 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2022-04-27 10:21:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2022-04-27 10:21:21,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:21:21,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-04-27 10:21:21,491 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2022-04-27 10:21:21,492 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2022-04-27 10:21:21,493 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:21:21,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:21:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:21:21,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:21:21,583 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:21:21,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:21:21,829 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:21:21,835 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:21:21,835 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-27 10:21:21,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:21 BoogieIcfgContainer [2022-04-27 10:21:21,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:21:21,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:21:21,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:21:21,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:21:21,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:21:21" (1/3) ... [2022-04-27 10:21:21,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfb1fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:21, skipping insertion in model container [2022-04-27 10:21:21,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:21:21" (2/3) ... [2022-04-27 10:21:21,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfb1fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:21:21, skipping insertion in model container [2022-04-27 10:21:21,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:21:21" (3/3) ... [2022-04-27 10:21:21,843 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-27 10:21:21,854 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:21:21,854 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:21:21,893 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:21:21,900 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7265ce61, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2610e80b [2022-04-27 10:21:21,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:21:21,909 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-27 10:21:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:21:21,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:21,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:21,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:21,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash -541205821, now seen corresponding path program 1 times [2022-04-27 10:21:21,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396149334] [2022-04-27 10:21:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:21,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,178 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-27 10:21:22,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-27 10:21:22,179 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-27 10:21:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-27 10:21:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,191 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-27 10:21:22,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-27 10:21:22,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-27 10:21:22,193 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-27 10:21:22,194 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-27 10:21:22,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-27 10:21:22,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-27 10:21:22,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret24 := main(); {58#true} is VALID [2022-04-27 10:21:22,195 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-27 10:21:22,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#true} assume !true; {59#false} is VALID [2022-04-27 10:21:22,197 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-27 10:21:22,197 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-27 10:21:22,197 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-27 10:21:22,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2022-04-27 10:21:22,198 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-27 10:21:22,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch5; {59#false} is VALID [2022-04-27 10:21:22,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-27 10:21:22,199 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-27 10:21:22,199 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-27 10:21:22,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2022-04-27 10:21:22,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-27 10:21:22,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short18 := 0 < ~j~0; {59#false} is VALID [2022-04-27 10:21:22,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#false} assume !#t~short18; {59#false} is VALID [2022-04-27 10:21:22,202 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-27 10:21:22,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2022-04-27 10:21:22,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2022-04-27 10:21:22,203 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-27 10:21:22,203 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-27 10:21:22,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-27 10:21:22,204 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-27 10:21:22,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret20.base, #t~ret20.offset; {59#false} is VALID [2022-04-27 10:21:22,205 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-27 10:21:22,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2022-04-27 10:21:22,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2022-04-27 10:21:22,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2022-04-27 10:21:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:22,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:22,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396149334] [2022-04-27 10:21:22,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396149334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:22,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:22,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:21:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747465537] [2022-04-27 10:21:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:22,222 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-27 10:21:22,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:22,227 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-27 10:21:22,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:22,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:21:22,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:22,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:21:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:21:22,298 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-27 10:21:22,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:22,472 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-04-27 10:21:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:21:22,473 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-27 10:21:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:22,474 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-27 10:21:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-27 10:21:22,482 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-27 10:21:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-27 10:21:22,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-04-27 10:21:22,635 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-27 10:21:22,645 INFO L225 Difference]: With dead ends: 102 [2022-04-27 10:21:22,645 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 10:21:22,648 INFO L412 NwaCegarLoop]: 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-27 10:21:22,652 INFO L413 NwaCegarLoop]: 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-27 10:21:22,653 INFO L414 NwaCegarLoop]: 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-27 10:21:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 10:21:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 10:21:22,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:22,686 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-27 10:21:22,687 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-27 10:21:22,689 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-27 10:21:22,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:22,702 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-27 10:21:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-27 10:21:22,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:22,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:22,705 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-27 10:21:22,707 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-27 10:21:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:22,710 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-27 10:21:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-27 10:21:22,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:22,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:22,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:22,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:22,712 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-27 10:21:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-04-27 10:21:22,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 32 [2022-04-27 10:21:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:22,722 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-04-27 10:21:22,723 INFO L496 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-27 10:21:22,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-27 10:21:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 10:21:22,726 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:22,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:21:22,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:22,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:22,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1555699344, now seen corresponding path program 1 times [2022-04-27 10:21:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:22,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619993890] [2022-04-27 10:21:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:22,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#(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); {349#true} is VALID [2022-04-27 10:21:22,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2022-04-27 10:21:22,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {349#true} {349#true} #158#return; {349#true} is VALID [2022-04-27 10:21:22,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-27 10:21:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:22,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#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; {349#true} is VALID [2022-04-27 10:21:22,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#true} assume true; {349#true} is VALID [2022-04-27 10:21:22,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {349#true} {350#false} #154#return; {350#false} is VALID [2022-04-27 10:21:22,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:22,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {358#(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); {349#true} is VALID [2022-04-27 10:21:22,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2022-04-27 10:21:22,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #158#return; {349#true} is VALID [2022-04-27 10:21:22,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret24 := main(); {349#true} is VALID [2022-04-27 10:21:22,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {354#(= main_~i~1 0)} is VALID [2022-04-27 10:21:22,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {354#(= main_~i~1 0)} assume !(~i~1 < 8); {350#false} is VALID [2022-04-27 10:21:22,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {350#false} is VALID [2022-04-27 10:21:22,833 INFO L272 TraceCheckUtils]: 8: Hoare triple {350#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {350#false} is VALID [2022-04-27 10:21:22,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#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); {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#false} assume !(~str.base == 0 && ~str.offset == 0); {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#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; {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {350#false} assume #t~switch5; {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {350#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {350#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {350#false} is VALID [2022-04-27 10:21:22,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {350#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {350#false} is VALID [2022-04-27 10:21:22,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {350#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {350#false} is VALID [2022-04-27 10:21:22,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {350#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {350#false} is VALID [2022-04-27 10:21:22,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {350#false} ~j~0 := ~i~0 - 1; {350#false} is VALID [2022-04-27 10:21:22,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {350#false} #t~short15 := 0 < ~j~0; {350#false} is VALID [2022-04-27 10:21:22,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {350#false} assume !#t~short15; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {350#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {350#false} #t~short18 := 0 < ~j~0; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {350#false} assume !#t~short18; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {350#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {350#false} assume ~start~0 <= ~j~0; {350#false} is VALID [2022-04-27 10:21:22,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {350#false} assume !(1 + (~j~0 - ~start~0) >= 2); {350#false} is VALID [2022-04-27 10:21:22,837 INFO L272 TraceCheckUtils]: 27: Hoare triple {350#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)); {349#true} is VALID [2022-04-27 10:21:22,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {349#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; {349#true} is VALID [2022-04-27 10:21:22,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {349#true} assume true; {349#true} is VALID [2022-04-27 10:21:22,837 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {349#true} {350#false} #154#return; {350#false} is VALID [2022-04-27 10:21:22,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {350#false} havoc #t~ret20.base, #t~ret20.offset; {350#false} is VALID [2022-04-27 10:21:22,837 INFO L272 TraceCheckUtils]: 32: Hoare triple {350#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {350#false} is VALID [2022-04-27 10:21:22,838 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#false} ~cond := #in~cond; {350#false} is VALID [2022-04-27 10:21:22,838 INFO L290 TraceCheckUtils]: 34: Hoare triple {350#false} assume 0 == ~cond; {350#false} is VALID [2022-04-27 10:21:22,838 INFO L290 TraceCheckUtils]: 35: Hoare triple {350#false} assume !false; {350#false} is VALID [2022-04-27 10:21:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:21:22,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:22,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619993890] [2022-04-27 10:21:22,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619993890] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:22,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:22,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:21:22,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331866739] [2022-04-27 10:21:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:22,841 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-27 10:21:22,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:22,841 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-27 10:21:22,872 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-27 10:21:22,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:21:22,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:21:22,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:21:22,879 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-27 10:21:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,083 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-04-27 10:21:23,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:21:23,083 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-27 10:21:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:23,083 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-27 10:21:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 10:21:23,090 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-27 10:21:23,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 10:21:23,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 10:21:23,209 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-27 10:21:23,213 INFO L225 Difference]: With dead ends: 88 [2022-04-27 10:21:23,213 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 10:21:23,216 INFO L412 NwaCegarLoop]: 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-27 10:21:23,218 INFO L413 NwaCegarLoop]: 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-27 10:21:23,219 INFO L414 NwaCegarLoop]: 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-27 10:21:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 10:21:23,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-27 10:21:23,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:23,229 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-27 10:21:23,229 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-27 10:21:23,230 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-27 10:21:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,235 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 10:21:23,235 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-27 10:21:23,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:23,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:23,236 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-27 10:21:23,236 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-27 10:21:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,239 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 10:21:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-27 10:21:23,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:23,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:23,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:23,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:23,241 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-27 10:21:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-04-27 10:21:23,243 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 36 [2022-04-27 10:21:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:23,243 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-04-27 10:21:23,243 INFO L496 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-27 10:21:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-27 10:21:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:21:23,244 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:23,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:23,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:21:23,244 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:23,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:23,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1615735470, now seen corresponding path program 1 times [2022-04-27 10:21:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:23,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895907927] [2022-04-27 10:21:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:23,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:23,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:23,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:23,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#(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); {636#true} is VALID [2022-04-27 10:21:23,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 10:21:23,305 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {636#true} {636#true} #158#return; {636#true} is VALID [2022-04-27 10:21:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:21:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:23,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {636#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; {636#true} is VALID [2022-04-27 10:21:23,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 10:21:23,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {636#true} {637#false} #154#return; {637#false} is VALID [2022-04-27 10:21:23,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {646#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:23,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#(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); {636#true} is VALID [2022-04-27 10:21:23,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 10:21:23,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #158#return; {636#true} is VALID [2022-04-27 10:21:23,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret24 := main(); {636#true} is VALID [2022-04-27 10:21:23,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {641#(= main_~i~1 0)} is VALID [2022-04-27 10:21:23,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#(= 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; {641#(= main_~i~1 0)} is VALID [2022-04-27 10:21:23,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {642#(<= main_~i~1 1)} is VALID [2022-04-27 10:21:23,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#(<= main_~i~1 1)} assume !(~i~1 < 8); {637#false} is VALID [2022-04-27 10:21:23,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {637#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {637#false} is VALID [2022-04-27 10:21:23,314 INFO L272 TraceCheckUtils]: 10: Hoare triple {637#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {637#false} is VALID [2022-04-27 10:21:23,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {637#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); {637#false} is VALID [2022-04-27 10:21:23,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {637#false} assume !(~str.base == 0 && ~str.offset == 0); {637#false} is VALID [2022-04-27 10:21:23,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#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; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#false} assume #t~switch5; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {637#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {637#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {637#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {637#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#false} ~j~0 := ~i~0 - 1; {637#false} is VALID [2022-04-27 10:21:23,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {637#false} #t~short15 := 0 < ~j~0; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {637#false} assume !#t~short15; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {637#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {637#false} #t~short18 := 0 < ~j~0; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {637#false} assume !#t~short18; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {637#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#false} assume ~start~0 <= ~j~0; {637#false} is VALID [2022-04-27 10:21:23,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {637#false} assume !(1 + (~j~0 - ~start~0) >= 2); {637#false} is VALID [2022-04-27 10:21:23,317 INFO L272 TraceCheckUtils]: 29: Hoare triple {637#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)); {636#true} is VALID [2022-04-27 10:21:23,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {636#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; {636#true} is VALID [2022-04-27 10:21:23,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 10:21:23,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {636#true} {637#false} #154#return; {637#false} is VALID [2022-04-27 10:21:23,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {637#false} havoc #t~ret20.base, #t~ret20.offset; {637#false} is VALID [2022-04-27 10:21:23,317 INFO L272 TraceCheckUtils]: 34: Hoare triple {637#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {637#false} is VALID [2022-04-27 10:21:23,317 INFO L290 TraceCheckUtils]: 35: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2022-04-27 10:21:23,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2022-04-27 10:21:23,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 10:21:23,318 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-27 10:21:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:23,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895907927] [2022-04-27 10:21:23,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895907927] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:23,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132645212] [2022-04-27 10:21:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:23,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:21:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:23,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-27 10:21:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:23,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:23,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {636#true} call ULTIMATE.init(); {636#true} is VALID [2022-04-27 10:21:23,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {636#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); {636#true} is VALID [2022-04-27 10:21:23,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#true} assume true; {636#true} is VALID [2022-04-27 10:21:23,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {636#true} {636#true} #158#return; {636#true} is VALID [2022-04-27 10:21:23,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {636#true} call #t~ret24 := main(); {636#true} is VALID [2022-04-27 10:21:23,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {636#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {636#true} is VALID [2022-04-27 10:21:23,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {636#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; {636#true} is VALID [2022-04-27 10:21:23,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {636#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {636#true} is VALID [2022-04-27 10:21:23,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {636#true} assume !(~i~1 < 8); {636#true} is VALID [2022-04-27 10:21:23,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {636#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {636#true} is VALID [2022-04-27 10:21:23,603 INFO L272 TraceCheckUtils]: 10: Hoare triple {636#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {636#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); {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {636#true} assume !(~str.base == 0 && ~str.offset == 0); {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {636#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; {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {636#true} assume #t~switch5; {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {636#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {636#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {636#true} is VALID [2022-04-27 10:21:23,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {636#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {636#true} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {636#true} ~j~0 := ~i~0 - 1; {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {636#true} #t~short15 := 0 < ~j~0; {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {636#true} assume !#t~short15; {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {636#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {636#true} is VALID [2022-04-27 10:21:23,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {636#true} #t~short18 := 0 < ~j~0; {636#true} is VALID [2022-04-27 10:21:23,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {636#true} assume !#t~short18; {725#(not |parse_expression_list_#t~short18|)} is VALID [2022-04-27 10:21:23,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {725#(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; {637#false} is VALID [2022-04-27 10:21:23,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {637#false} assume ~start~0 <= ~j~0; {637#false} is VALID [2022-04-27 10:21:23,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {637#false} assume !(1 + (~j~0 - ~start~0) >= 2); {637#false} is VALID [2022-04-27 10:21:23,606 INFO L272 TraceCheckUtils]: 29: Hoare triple {637#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)); {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {637#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; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {637#false} assume true; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {637#false} {637#false} #154#return; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {637#false} havoc #t~ret20.base, #t~ret20.offset; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L272 TraceCheckUtils]: 34: Hoare triple {637#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 35: Hoare triple {637#false} ~cond := #in~cond; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 36: Hoare triple {637#false} assume 0 == ~cond; {637#false} is VALID [2022-04-27 10:21:23,607 INFO L290 TraceCheckUtils]: 37: Hoare triple {637#false} assume !false; {637#false} is VALID [2022-04-27 10:21:23,608 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-27 10:21:23,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 10:21:23,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132645212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:23,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 10:21:23,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-27 10:21:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085438774] [2022-04-27 10:21:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:23,609 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-27 10:21:23,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:23,610 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-27 10:21:23,653 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-27 10:21:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:21:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:23,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:21:23,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:21:23,655 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-27 10:21:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,721 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-27 10:21:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:21:23,721 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-27 10:21:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:23,722 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-27 10:21:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-27 10:21:23,724 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-27 10:21:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-27 10:21:23,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-04-27 10:21:23,799 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-27 10:21:23,800 INFO L225 Difference]: With dead ends: 84 [2022-04-27 10:21:23,801 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 10:21:23,801 INFO L412 NwaCegarLoop]: 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-27 10:21:23,802 INFO L413 NwaCegarLoop]: 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-27 10:21:23,802 INFO L414 NwaCegarLoop]: 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-27 10:21:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 10:21:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-27 10:21:23,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:23,807 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-27 10:21:23,807 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-27 10:21:23,807 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-27 10:21:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,809 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 10:21:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-27 10:21:23,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:23,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:23,810 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-27 10:21:23,810 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-27 10:21:23,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:23,812 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-27 10:21:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-27 10:21:23,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:23,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:23,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:23,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:23,812 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-27 10:21:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-27 10:21:23,814 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2022-04-27 10:21:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:23,814 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-27 10:21:23,814 INFO L496 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-27 10:21:23,814 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-27 10:21:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 10:21:23,815 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:23,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:23,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:24,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:24,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:24,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1357570032, now seen corresponding path program 1 times [2022-04-27 10:21:24,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:24,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406116269] [2022-04-27 10:21:24,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:24,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:24,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {1039#(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); {1029#true} is VALID [2022-04-27 10:21:24,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1029#true} {1029#true} #158#return; {1029#true} is VALID [2022-04-27 10:21:24,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-27 10:21:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:24,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {1029#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; {1029#true} is VALID [2022-04-27 10:21:24,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1029#true} {1030#false} #154#return; {1030#false} is VALID [2022-04-27 10:21:24,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {1029#true} call ULTIMATE.init(); {1039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:24,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1039#(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); {1029#true} is VALID [2022-04-27 10:21:24,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1029#true} {1029#true} #158#return; {1029#true} is VALID [2022-04-27 10:21:24,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1029#true} call #t~ret24 := main(); {1029#true} is VALID [2022-04-27 10:21:24,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {1029#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1034#(= main_~i~1 0)} is VALID [2022-04-27 10:21:24,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {1034#(= 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; {1034#(= main_~i~1 0)} is VALID [2022-04-27 10:21:24,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {1034#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1035#(<= main_~i~1 1)} is VALID [2022-04-27 10:21:24,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {1035#(<= main_~i~1 1)} assume !(~i~1 < 8); {1030#false} is VALID [2022-04-27 10:21:24,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1030#false} is VALID [2022-04-27 10:21:24,124 INFO L272 TraceCheckUtils]: 10: Hoare triple {1030#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1030#false} is VALID [2022-04-27 10:21:24,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1030#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); {1030#false} is VALID [2022-04-27 10:21:24,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1030#false} assume !(~str.base == 0 && ~str.offset == 0); {1030#false} is VALID [2022-04-27 10:21:24,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {1030#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; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {1030#false} assume #t~switch5; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {1030#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {1030#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {1030#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {1030#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {1030#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1030#false} is VALID [2022-04-27 10:21:24,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {1030#false} ~j~0 := ~i~0 - 1; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {1030#false} #t~short15 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {1030#false} assume !#t~short15; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {1030#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 24: Hoare triple {1030#false} #t~short18 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 25: Hoare triple {1030#false} assume !#t~short18; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 26: Hoare triple {1030#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 27: Hoare triple {1030#false} assume ~start~0 <= ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {1030#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1030#false} is VALID [2022-04-27 10:21:24,127 INFO L272 TraceCheckUtils]: 29: Hoare triple {1030#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)); {1029#true} is VALID [2022-04-27 10:21:24,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {1029#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; {1029#true} is VALID [2022-04-27 10:21:24,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,127 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1029#true} {1030#false} #154#return; {1030#false} is VALID [2022-04-27 10:21:24,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {1030#false} havoc #t~ret20.base, #t~ret20.offset; {1030#false} is VALID [2022-04-27 10:21:24,127 INFO L272 TraceCheckUtils]: 34: Hoare triple {1030#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1030#false} is VALID [2022-04-27 10:21:24,127 INFO L290 TraceCheckUtils]: 35: Hoare triple {1030#false} ~cond := #in~cond; {1030#false} is VALID [2022-04-27 10:21:24,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {1030#false} assume 0 == ~cond; {1030#false} is VALID [2022-04-27 10:21:24,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {1030#false} assume !false; {1030#false} is VALID [2022-04-27 10:21:24,128 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-27 10:21:24,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:24,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406116269] [2022-04-27 10:21:24,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406116269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:21:24,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624808906] [2022-04-27 10:21:24,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:21:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:21:24,136 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:21:24,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:21:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:24,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:21:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:24,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:21:24,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {1029#true} call ULTIMATE.init(); {1029#true} is VALID [2022-04-27 10:21:24,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1029#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); {1029#true} is VALID [2022-04-27 10:21:24,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1029#true} {1029#true} #158#return; {1029#true} is VALID [2022-04-27 10:21:24,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {1029#true} call #t~ret24 := main(); {1029#true} is VALID [2022-04-27 10:21:24,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {1029#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1058#(<= main_~i~1 0)} is VALID [2022-04-27 10:21:24,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(<= 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; {1058#(<= main_~i~1 0)} is VALID [2022-04-27 10:21:24,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {1058#(<= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1035#(<= main_~i~1 1)} is VALID [2022-04-27 10:21:24,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {1035#(<= main_~i~1 1)} assume !(~i~1 < 8); {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L272 TraceCheckUtils]: 10: Hoare triple {1030#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {1030#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); {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {1030#false} assume !(~str.base == 0 && ~str.offset == 0); {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {1030#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; {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {1030#false} assume #t~switch5; {1030#false} is VALID [2022-04-27 10:21:24,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1030#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1030#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {1030#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {1030#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {1030#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {1030#false} ~j~0 := ~i~0 - 1; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {1030#false} #t~short15 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {1030#false} assume !#t~short15; {1030#false} is VALID [2022-04-27 10:21:24,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {1030#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {1030#false} #t~short18 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {1030#false} assume !#t~short18; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {1030#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {1030#false} assume ~start~0 <= ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {1030#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L272 TraceCheckUtils]: 29: Hoare triple {1030#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)); {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {1030#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; {1030#false} is VALID [2022-04-27 10:21:24,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {1030#false} assume true; {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1030#false} {1030#false} #154#return; {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {1030#false} havoc #t~ret20.base, #t~ret20.offset; {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L272 TraceCheckUtils]: 34: Hoare triple {1030#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {1030#false} ~cond := #in~cond; {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {1030#false} assume 0 == ~cond; {1030#false} is VALID [2022-04-27 10:21:24,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {1030#false} assume !false; {1030#false} is VALID [2022-04-27 10:21:24,373 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-27 10:21:24,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:21:24,511 INFO L290 TraceCheckUtils]: 37: Hoare triple {1030#false} assume !false; {1030#false} is VALID [2022-04-27 10:21:24,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {1030#false} assume 0 == ~cond; {1030#false} is VALID [2022-04-27 10:21:24,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {1030#false} ~cond := #in~cond; {1030#false} is VALID [2022-04-27 10:21:24,516 INFO L272 TraceCheckUtils]: 34: Hoare triple {1030#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1030#false} is VALID [2022-04-27 10:21:24,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {1030#false} havoc #t~ret20.base, #t~ret20.offset; {1030#false} is VALID [2022-04-27 10:21:24,522 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1029#true} {1030#false} #154#return; {1030#false} is VALID [2022-04-27 10:21:24,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {1029#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; {1029#true} is VALID [2022-04-27 10:21:24,522 INFO L272 TraceCheckUtils]: 29: Hoare triple {1030#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)); {1029#true} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {1030#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {1030#false} assume ~start~0 <= ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {1030#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {1030#false} assume !#t~short18; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {1030#false} #t~short18 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {1030#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {1030#false} assume !#t~short15; {1030#false} is VALID [2022-04-27 10:21:24,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {1030#false} #t~short15 := 0 < ~j~0; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1030#false} ~j~0 := ~i~0 - 1; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1030#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {1030#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {1030#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {1030#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {1030#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {1030#false} assume #t~switch5; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {1030#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; {1030#false} is VALID [2022-04-27 10:21:24,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {1030#false} assume !(~str.base == 0 && ~str.offset == 0); {1030#false} is VALID [2022-04-27 10:21:24,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {1030#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); {1030#false} is VALID [2022-04-27 10:21:24,525 INFO L272 TraceCheckUtils]: 10: Hoare triple {1030#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1030#false} is VALID [2022-04-27 10:21:24,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1030#false} is VALID [2022-04-27 10:21:24,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {1242#(< main_~i~1 8)} assume !(~i~1 < 8); {1030#false} is VALID [2022-04-27 10:21:24,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {1246#(< main_~i~1 7)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1242#(< main_~i~1 8)} is VALID [2022-04-27 10:21:24,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {1246#(< main_~i~1 7)} 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; {1246#(< main_~i~1 7)} is VALID [2022-04-27 10:21:24,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {1029#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1246#(< main_~i~1 7)} is VALID [2022-04-27 10:21:24,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {1029#true} call #t~ret24 := main(); {1029#true} is VALID [2022-04-27 10:21:24,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1029#true} {1029#true} #158#return; {1029#true} is VALID [2022-04-27 10:21:24,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {1029#true} assume true; {1029#true} is VALID [2022-04-27 10:21:24,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {1029#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); {1029#true} is VALID [2022-04-27 10:21:24,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {1029#true} call ULTIMATE.init(); {1029#true} is VALID [2022-04-27 10:21:24,532 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-27 10:21:24,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624808906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:21:24,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:21:24,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:21:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893159876] [2022-04-27 10:21:24,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:21:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-04-27 10:21:24,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:24,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:21:24,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:21:24,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:24,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:21:24,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:21:24,576 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:21:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,003 INFO L93 Difference]: Finished difference Result 95 states and 117 transitions. [2022-04-27 10:21:25,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:21:25,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-04-27 10:21:25,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:25,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:21:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-04-27 10:21:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:21:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2022-04-27 10:21:25,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 115 transitions. [2022-04-27 10:21:25,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:21:25,115 INFO L225 Difference]: With dead ends: 95 [2022-04-27 10:21:25,115 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 10:21:25,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:21:25,117 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 56 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:25,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 75 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:21:25,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 10:21:25,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 10:21:25,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:25,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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-27 10:21:25,131 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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-27 10:21:25,131 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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-27 10:21:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,133 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 10:21:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 10:21:25,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:25,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:25,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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 55 states. [2022-04-27 10:21:25,135 INFO L87 Difference]: Start difference. First operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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 55 states. [2022-04-27 10:21:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,137 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-27 10:21:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 10:21:25,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:25,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:25,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:25,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:25,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 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-27 10:21:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-04-27 10:21:25,139 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 38 [2022-04-27 10:21:25,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:25,140 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-04-27 10:21:25,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 10:21:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-04-27 10:21:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 10:21:25,141 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:21:25,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:21:25,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:21:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:21:25,355 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:21:25,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:21:25,356 INFO L85 PathProgramCache]: Analyzing trace with hash -688602954, now seen corresponding path program 2 times [2022-04-27 10:21:25,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:21:25,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177742439] [2022-04-27 10:21:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:21:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:21:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:21:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:25,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1594#(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); {1583#true} is VALID [2022-04-27 10:21:25,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1583#true} assume true; {1583#true} is VALID [2022-04-27 10:21:25,482 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1583#true} {1583#true} #158#return; {1583#true} is VALID [2022-04-27 10:21:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-04-27 10:21:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:21:25,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1583#true} assume true; {1583#true} is VALID [2022-04-27 10:21:25,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1583#true} {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} #154#return; {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-27 10:21:25,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {1583#true} call ULTIMATE.init(); {1594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:21:25,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {1594#(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); {1583#true} is VALID [2022-04-27 10:21:25,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {1583#true} assume true; {1583#true} is VALID [2022-04-27 10:21:25,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1583#true} {1583#true} #158#return; {1583#true} is VALID [2022-04-27 10:21:25,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {1583#true} call #t~ret24 := main(); {1583#true} is VALID [2022-04-27 10:21:25,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {1583#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1583#true} is VALID [2022-04-27 10:21:25,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {1583#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {1583#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {1583#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {1583#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {1583#true} assume !(~i~1 < 8); {1583#true} is VALID [2022-04-27 10:21:25,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {1583#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L272 TraceCheckUtils]: 16: Hoare triple {1583#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {1583#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); {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1583#true} assume !(~str.base == 0 && ~str.offset == 0); {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {1583#true} assume #t~switch5; {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {1583#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {1583#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {1583#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1583#true} is VALID [2022-04-27 10:21:25,491 INFO L290 TraceCheckUtils]: 24: Hoare triple {1583#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {1583#true} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {1583#true} ~j~0 := ~i~0 - 1; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {1583#true} #t~short15 := 0 < ~j~0; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {1583#true} assume !#t~short15; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {1583#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {1583#true} #t~short18 := 0 < ~j~0; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {1583#true} assume !#t~short18; {1583#true} is VALID [2022-04-27 10:21:25,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {1583#true} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1583#true} is VALID [2022-04-27 10:21:25,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {1583#true} assume ~start~0 <= ~j~0; {1583#true} is VALID [2022-04-27 10:21:25,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {1583#true} assume !(1 + (~j~0 - ~start~0) >= 2); {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-27 10:21:25,493 INFO L272 TraceCheckUtils]: 35: Hoare triple {1588#(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)); {1583#true} is VALID [2022-04-27 10:21:25,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {1583#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; {1583#true} is VALID [2022-04-27 10:21:25,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {1583#true} assume true; {1583#true} is VALID [2022-04-27 10:21:25,494 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1583#true} {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} #154#return; {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-27 10:21:25,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} havoc #t~ret20.base, #t~ret20.offset; {1588#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-27 10:21:25,495 INFO L272 TraceCheckUtils]: 40: Hoare triple {1588#(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)); {1592#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:21:25,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {1592#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1593#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:21:25,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {1593#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1584#false} is VALID [2022-04-27 10:21:25,496 INFO L290 TraceCheckUtils]: 43: Hoare triple {1584#false} assume !false; {1584#false} is VALID [2022-04-27 10:21:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 10:21:25,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:21:25,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177742439] [2022-04-27 10:21:25,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177742439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:21:25,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:21:25,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:21:25,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191752240] [2022-04-27 10:21:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:21:25,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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 44 [2022-04-27 10:21:25,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:21:25,498 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), 4 states have internal predecessors, (31), 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-27 10:21:25,525 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-27 10:21:25,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:21:25,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:21:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:21:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:21:25,526 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-27 10:21:25,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,884 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-27 10:21:25,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:21:25,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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 44 [2022-04-27 10:21:25,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:21:25,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-27 10:21:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-27 10:21:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-27 10:21:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2022-04-27 10:21:25,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2022-04-27 10:21:25,958 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-27 10:21:25,958 INFO L225 Difference]: With dead ends: 66 [2022-04-27 10:21:25,958 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:21:25,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 10:21:25,959 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:21:25,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 62 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:21:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:21:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:21:25,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:21:25,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:25,960 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:25,960 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,961 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:25,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:25,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:25,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:21:25,961 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 10:21:25,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:21:25,961 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:21:25,962 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:25,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:25,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:21:25,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:21:25,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:21:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 10:21:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:21:25,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2022-04-27 10:21:25,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:21:25,962 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:21:25,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 4 states have internal predecessors, (31), 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-27 10:21:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:21:25,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:21:25,965 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:21:25,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:21:25,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:21:26,008 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 10:21:26,008 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 10:21:26,008 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 10:21:26,008 INFO L899 garLoopResultBuilder]: For program point r_strncpyFINAL(line 42) no Hoare annotation was computed. [2022-04-27 10:21:26,008 INFO L899 garLoopResultBuilder]: For program point r_strncpyEXIT(line 42) no Hoare annotation was computed. [2022-04-27 10:21:26,008 INFO L902 garLoopResultBuilder]: At program point r_strncpyENTRY(line 42) the Hoare annotation is: true [2022-04-27 10:21:26,008 INFO L902 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: true [2022-04-27 10:21:26,008 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 87 96) the Hoare annotation is: true [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L94-1(line 94) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 87 96) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L90-2(lines 90 92) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L902 garLoopResultBuilder]: At program point L90-3(lines 90 92) the Hoare annotation is: true [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L90-4(lines 90 92) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 87 96) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L895 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-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 83) no Hoare annotation was computed. [2022-04-27 10:21:26,009 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point parse_expression_listFINAL(lines 58 86) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L902 garLoopResultBuilder]: At program point L70-8(line 70) the Hoare annotation is: true [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L70-9(line 70) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L902 garLoopResultBuilder]: At program point parse_expression_listENTRY(lines 58 86) the Hoare annotation is: true [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-04-27 10:21:26,010 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L71-4(lines 65 83) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L67-3(line 67) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L902 garLoopResultBuilder]: At program point L67-5(line 67) the Hoare annotation is: true [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 84) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L67-6(line 67) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L63-2(lines 63 84) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point parse_expression_listEXIT(lines 58 86) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L902 garLoopResultBuilder]: At program point L63-4(lines 63 84) the Hoare annotation is: true [2022-04-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L63-5(lines 63 84) no Hoare annotation was computed. [2022-04-27 10:21:26,011 INFO L895 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-27 10:21:26,011 INFO L899 garLoopResultBuilder]: For program point L76-1(line 76) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 81) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point L68-2(line 68) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:21:26,012 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L899 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-04-27 10:21:26,012 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-27 10:21:26,013 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:21:26,013 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 19) no Hoare annotation was computed. [2022-04-27 10:21:26,013 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-04-27 10:21:26,015 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-04-27 10:21:26,017 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:21:26,020 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:21:26,020 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:21:26,020 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 10:21:26,020 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:26,020 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: r_strncpyFINAL has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: parse_expression_listFINAL has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: L63-5 has no Hoare annotation [2022-04-27 10:21:26,021 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: r_strncpyEXIT has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: parse_expression_listEXIT has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L63-5 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:21:26,022 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-6 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L77-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-6 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-04-27 10:21:26,023 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-9 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-9 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-6 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L70-6 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-04-27 10:21:26,024 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L71-4 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L71-4 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-04-27 10:21:26,025 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-27 10:21:26,025 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:21:26,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:21:26 BoogieIcfgContainer [2022-04-27 10:21:26,030 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:21:26,031 INFO L158 Benchmark]: Toolchain (without parser) took 4886.28ms. Allocated memory was 189.8MB in the beginning and 234.9MB in the end (delta: 45.1MB). Free memory was 139.7MB in the beginning and 176.0MB in the end (delta: -36.3MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-27 10:21:26,031 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 156.5MB in the beginning and 156.4MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:21:26,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.33ms. Allocated memory is still 189.8MB. Free memory was 139.5MB in the beginning and 164.7MB in the end (delta: -25.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. [2022-04-27 10:21:26,031 INFO L158 Benchmark]: Boogie Preprocessor took 44.03ms. Allocated memory is still 189.8MB. Free memory was 164.7MB in the beginning and 162.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:21:26,032 INFO L158 Benchmark]: RCFGBuilder took 415.50ms. Allocated memory is still 189.8MB. Free memory was 162.3MB in the beginning and 144.7MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-27 10:21:26,032 INFO L158 Benchmark]: TraceAbstraction took 4192.11ms. Allocated memory was 189.8MB in the beginning and 234.9MB in the end (delta: 45.1MB). Free memory was 144.2MB in the beginning and 176.0MB in the end (delta: -31.8MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2022-04-27 10:21:26,033 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 189.8MB. Free memory was 156.5MB in the beginning and 156.4MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.33ms. Allocated memory is still 189.8MB. Free memory was 139.5MB in the beginning and 164.7MB in the end (delta: -25.2MB). Peak memory consumption was 12.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.03ms. Allocated memory is still 189.8MB. Free memory was 164.7MB in the beginning and 162.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 415.50ms. Allocated memory is still 189.8MB. Free memory was 162.3MB in the beginning and 144.7MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 4192.11ms. Allocated memory was 189.8MB in the beginning and 234.9MB in the end (delta: 45.1MB). Free memory was 144.2MB in the beginning and 176.0MB in the end (delta: -31.8MB). Peak memory consumption was 14.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: 4.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 244 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 373 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 423 IncrementalHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 272 mSDtfsCounter, 423 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 160 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 40 PreInvPairs, 52 NumberOfFragments, 30 HoareAnnotationTreeSize, 40 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 336 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 17/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 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 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:21:26,062 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...