/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:04:25,927 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:04:25,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:04:25,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:04:25,972 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:04:25,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:04:25,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:04:25,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:04:25,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:04:25,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:04:25,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:04:25,977 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:04:25,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:04:25,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:04:25,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:04:25,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:04:25,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:04:25,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:04:25,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:04:25,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:04:25,996 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:04:25,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:04:25,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:04:25,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:04:25,998 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:04:26,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:04:26,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:04:26,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:04:26,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:04:26,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:04:26,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:04:26,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:04:26,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:04:26,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:04:26,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:04:26,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:04:26,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:04:26,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:04:26,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:04:26,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:04:26,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:04:26,005 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:04:26,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:04:26,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:04:26,024 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:04:26,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:04:26,025 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:04:26,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:26,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:04:26,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:04:26,027 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:04:26,027 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 09:04:26,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:04:26,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:04:26,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:04:26,235 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:04:26,240 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:04:26,241 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-28 09:04:26,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a564ee4/d0c99549e7074b7b8bbf656b57b5d145/FLAGa97cd5f9b [2022-04-28 09:04:26,602 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:04:26,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-28 09:04:26,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a564ee4/d0c99549e7074b7b8bbf656b57b5d145/FLAGa97cd5f9b [2022-04-28 09:04:27,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a564ee4/d0c99549e7074b7b8bbf656b57b5d145 [2022-04-28 09:04:27,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:04:27,055 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:04:27,056 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:27,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:04:27,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:04:27,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347d6bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27, skipping insertion in model container [2022-04-28 09:04:27,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:04:27,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:04:27,251 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-28 09:04:27,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:27,290 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:04:27,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-28 09:04:27,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:27,326 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:04:27,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27 WrapperNode [2022-04-28 09:04:27,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:27,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:04:27,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:04:27,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:04:27,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,349 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:04:27,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:04:27,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:04:27,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:04:27,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (1/1) ... [2022-04-28 09:04:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:27,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:27,419 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-28 09:04:27,425 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-28 09:04:27,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:04:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:04:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:04:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:04:27,446 INFO L138 BoogieDeclarations]: Found implementation of procedure r_strncpy [2022-04-28 09:04:27,447 INFO L138 BoogieDeclarations]: Found implementation of procedure parse_expression_list [2022-04-28 09:04:27,447 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:04:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:04:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:04:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 09:04:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 09:04:27,447 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:04:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:04:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-28 09:04:27,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy_ptr [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2022-04-28 09:04:27,450 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure isascii [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure isspace [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure getc [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure strrand [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure istrrand [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure istrchr [2022-04-28 09:04:27,451 INFO L130 BoogieDeclarations]: Found specification of procedure istrrchr [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure istrncmp [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure istrstr [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncpy [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcpy [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure r_strcat [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure r_strncat [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure r_memcpy [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure parse_expression_list [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:04:27,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:04:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:04:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:04:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:04:27,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:04:27,527 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:04:27,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:04:27,754 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:04:27,760 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:04:27,760 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 09:04:27,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:27 BoogieIcfgContainer [2022-04-28 09:04:27,761 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:04:27,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:04:27,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:04:27,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:04:27,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:04:27" (1/3) ... [2022-04-28 09:04:27,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df4cf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:27, skipping insertion in model container [2022-04-28 09:04:27,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:27" (2/3) ... [2022-04-28 09:04:27,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df4cf4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:27, skipping insertion in model container [2022-04-28 09:04:27,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:27" (3/3) ... [2022-04-28 09:04:27,768 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-04-28 09:04:27,777 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:04:27,777 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:04:27,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:04:27,808 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b78953d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fff737c [2022-04-28 09:04:27,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:04:27,814 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-28 09:04:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 09:04:27,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:27,820 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-28 09:04:27,820 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:27,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:27,823 INFO L85 PathProgramCache]: Analyzing trace with hash -541205821, now seen corresponding path program 1 times [2022-04-28 09:04:27,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:27,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1681567942] [2022-04-28 09:04:27,834 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:27,835 INFO L85 PathProgramCache]: Analyzing trace with hash -541205821, now seen corresponding path program 2 times [2022-04-28 09:04:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:27,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127826983] [2022-04-28 09:04:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:27,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:28,019 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-28 09:04:28,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-28 09:04:28,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-28 09:04:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-28 09:04:28,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:28,030 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-28 09:04:28,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-28 09:04:28,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-28 09:04:28,032 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-28 09:04:28,032 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-28 09:04:28,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-28 09:04:28,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #158#return; {58#true} is VALID [2022-04-28 09:04:28,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret24 := main(); {58#true} is VALID [2022-04-28 09:04:28,032 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-28 09:04:28,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#true} assume !true; {59#false} is VALID [2022-04-28 09:04:28,033 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-28 09:04:28,033 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-28 09:04:28,034 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-28 09:04:28,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {59#false} assume !(~str.base == 0 && ~str.offset == 0); {59#false} is VALID [2022-04-28 09:04:28,034 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-28 09:04:28,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {59#false} assume #t~switch5; {59#false} is VALID [2022-04-28 09:04:28,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-28 09:04:28,034 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-28 09:04:28,035 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-28 09:04:28,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {59#false} ~j~0 := ~i~0 - 1; {59#false} is VALID [2022-04-28 09:04:28,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {59#false} assume !true; {59#false} is VALID [2022-04-28 09:04:28,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {59#false} #t~short18 := 0 < ~j~0; {59#false} is VALID [2022-04-28 09:04:28,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {59#false} assume !#t~short18; {59#false} is VALID [2022-04-28 09:04:28,035 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-28 09:04:28,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {59#false} assume ~start~0 <= ~j~0; {59#false} is VALID [2022-04-28 09:04:28,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {59#false} assume !(1 + (~j~0 - ~start~0) >= 2); {59#false} is VALID [2022-04-28 09:04:28,036 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-28 09:04:28,036 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-28 09:04:28,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {58#true} assume true; {58#true} is VALID [2022-04-28 09:04:28,036 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {58#true} {59#false} #154#return; {59#false} is VALID [2022-04-28 09:04:28,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {59#false} havoc #t~ret20.base, #t~ret20.offset; {59#false} is VALID [2022-04-28 09:04:28,037 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-28 09:04:28,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {59#false} ~cond := #in~cond; {59#false} is VALID [2022-04-28 09:04:28,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {59#false} assume 0 == ~cond; {59#false} is VALID [2022-04-28 09:04:28,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {59#false} assume !false; {59#false} is VALID [2022-04-28 09:04:28,038 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-28 09:04:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127826983] [2022-04-28 09:04:28,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127826983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:28,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:28,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:28,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:28,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1681567942] [2022-04-28 09:04:28,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1681567942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:28,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:28,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:28,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296772147] [2022-04-28 09:04:28,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:28,051 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-28 09:04:28,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:28,054 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-28 09:04:28,094 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-28 09:04:28,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:04:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:28,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:04:28,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:04:28,117 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-28 09:04:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,275 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2022-04-28 09:04:28,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:04:28,275 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-28 09:04:28,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:28,276 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-28 09:04:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-28 09:04:28,283 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-28 09:04:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-04-28 09:04:28,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-04-28 09:04:28,387 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-28 09:04:28,403 INFO L225 Difference]: With dead ends: 102 [2022-04-28 09:04:28,403 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 09:04:28,406 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-28 09:04:28,409 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-28 09:04:28,410 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-28 09:04:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 09:04:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 09:04:28,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:28,438 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-28 09:04:28,439 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-28 09:04:28,440 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-28 09:04:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,446 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:04:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:04:28,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:28,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:28,448 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-28 09:04:28,450 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-28 09:04:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,452 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 09:04:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:04:28,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:28,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:28,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:28,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:28,453 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-28 09:04:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2022-04-28 09:04:28,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 32 [2022-04-28 09:04:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:28,461 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-04-28 09:04:28,461 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-28 09:04:28,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 57 transitions. [2022-04-28 09:04:28,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 09:04:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 09:04:28,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:28,508 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-28 09:04:28,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:04:28,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:28,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:28,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1555699344, now seen corresponding path program 1 times [2022-04-28 09:04:28,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:28,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1042854620] [2022-04-28 09:04:28,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1555699344, now seen corresponding path program 2 times [2022-04-28 09:04:28,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:28,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450043888] [2022-04-28 09:04:28,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:28,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:28,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:28,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {461#true} is VALID [2022-04-28 09:04:28,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-28 09:04:28,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {461#true} #158#return; {461#true} is VALID [2022-04-28 09:04:28,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-28 09:04:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:28,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {461#true} is VALID [2022-04-28 09:04:28,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-28 09:04:28,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {461#true} {462#false} #154#return; {462#false} is VALID [2022-04-28 09:04:28,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {461#true} call ULTIMATE.init(); {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:28,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {461#true} is VALID [2022-04-28 09:04:28,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-28 09:04:28,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {461#true} {461#true} #158#return; {461#true} is VALID [2022-04-28 09:04:28,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {461#true} call #t~ret24 := main(); {461#true} is VALID [2022-04-28 09:04:28,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {461#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {466#(= main_~i~1 0)} is VALID [2022-04-28 09:04:28,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(= main_~i~1 0)} assume !(~i~1 < 8); {462#false} is VALID [2022-04-28 09:04:28,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {462#false} is VALID [2022-04-28 09:04:28,602 INFO L272 TraceCheckUtils]: 8: Hoare triple {462#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {462#false} is VALID [2022-04-28 09:04:28,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {462#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {462#false} is VALID [2022-04-28 09:04:28,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {462#false} assume !(~str.base == 0 && ~str.offset == 0); {462#false} is VALID [2022-04-28 09:04:28,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {462#false} is VALID [2022-04-28 09:04:28,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#false} assume #t~switch5; {462#false} is VALID [2022-04-28 09:04:28,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {462#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {462#false} is VALID [2022-04-28 09:04:28,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {462#false} is VALID [2022-04-28 09:04:28,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {462#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {462#false} is VALID [2022-04-28 09:04:28,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {462#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {462#false} is VALID [2022-04-28 09:04:28,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {462#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {462#false} is VALID [2022-04-28 09:04:28,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {462#false} ~j~0 := ~i~0 - 1; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {462#false} #t~short15 := 0 < ~j~0; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {462#false} assume !#t~short15; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {462#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {462#false} #t~short18 := 0 < ~j~0; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {462#false} assume !#t~short18; {462#false} is VALID [2022-04-28 09:04:28,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {462#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {462#false} is VALID [2022-04-28 09:04:28,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {462#false} assume ~start~0 <= ~j~0; {462#false} is VALID [2022-04-28 09:04:28,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {462#false} assume !(1 + (~j~0 - ~start~0) >= 2); {462#false} is VALID [2022-04-28 09:04:28,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {462#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {461#true} is VALID [2022-04-28 09:04:28,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {461#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {461#true} is VALID [2022-04-28 09:04:28,608 INFO L290 TraceCheckUtils]: 29: Hoare triple {461#true} assume true; {461#true} is VALID [2022-04-28 09:04:28,609 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {461#true} {462#false} #154#return; {462#false} is VALID [2022-04-28 09:04:28,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {462#false} havoc #t~ret20.base, #t~ret20.offset; {462#false} is VALID [2022-04-28 09:04:28,610 INFO L272 TraceCheckUtils]: 32: Hoare triple {462#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {462#false} is VALID [2022-04-28 09:04:28,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {462#false} ~cond := #in~cond; {462#false} is VALID [2022-04-28 09:04:28,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {462#false} assume 0 == ~cond; {462#false} is VALID [2022-04-28 09:04:28,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {462#false} assume !false; {462#false} is VALID [2022-04-28 09:04:28,611 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-28 09:04:28,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:28,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450043888] [2022-04-28 09:04:28,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450043888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:28,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:28,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:04:28,613 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:28,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1042854620] [2022-04-28 09:04:28,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1042854620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:28,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:28,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 09:04:28,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747690627] [2022-04-28 09:04:28,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:28,617 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-28 09:04:28,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:28,622 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-28 09:04:28,658 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-28 09:04:28,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 09:04:28,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:28,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 09:04:28,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 09:04:28,659 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-28 09:04:28,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,848 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-04-28 09:04:28,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:04:28,849 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-28 09:04:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:28,849 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-28 09:04:28,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 09:04:28,851 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-28 09:04:28,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 09:04:28,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 09:04:28,963 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-28 09:04:28,968 INFO L225 Difference]: With dead ends: 88 [2022-04-28 09:04:28,968 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 09:04:28,968 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-28 09:04:28,971 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-28 09:04:28,971 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-28 09:04:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 09:04:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-04-28 09:04:28,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:28,983 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-28 09:04:28,984 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-28 09:04:28,984 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-28 09:04:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,987 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 09:04:28,988 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 09:04:28,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:28,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:28,988 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-28 09:04:28,989 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-28 09:04:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:28,990 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 09:04:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 09:04:28,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:28,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:28,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:28,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:28,995 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-28 09:04:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-04-28 09:04:28,998 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 36 [2022-04-28 09:04:28,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:28,998 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-04-28 09:04:28,998 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-28 09:04:28,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 58 transitions. [2022-04-28 09:04:29,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-28 09:04:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:04:29,043 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:29,043 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-28 09:04:29,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:04:29,046 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1615735470, now seen corresponding path program 1 times [2022-04-28 09:04:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:29,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217735046] [2022-04-28 09:04:29,061 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:29,061 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1615735470, now seen corresponding path program 2 times [2022-04-28 09:04:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:29,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795667914] [2022-04-28 09:04:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:29,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-28 09:04:29,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-28 09:04:29,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-28 09:04:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:04:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,137 INFO L290 TraceCheckUtils]: 0: Hoare triple {845#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {845#true} is VALID [2022-04-28 09:04:29,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-28 09:04:29,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {845#true} {846#false} #154#return; {846#false} is VALID [2022-04-28 09:04:29,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:29,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-28 09:04:29,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-28 09:04:29,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-28 09:04:29,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret24 := main(); {845#true} is VALID [2022-04-28 09:04:29,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {850#(= main_~i~1 0)} is VALID [2022-04-28 09:04:29,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {850#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {850#(= main_~i~1 0)} is VALID [2022-04-28 09:04:29,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {850#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {851#(<= main_~i~1 1)} is VALID [2022-04-28 09:04:29,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {851#(<= main_~i~1 1)} assume !(~i~1 < 8); {846#false} is VALID [2022-04-28 09:04:29,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {846#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {846#false} is VALID [2022-04-28 09:04:29,140 INFO L272 TraceCheckUtils]: 10: Hoare triple {846#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {846#false} is VALID [2022-04-28 09:04:29,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {846#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {846#false} is VALID [2022-04-28 09:04:29,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#false} assume !(~str.base == 0 && ~str.offset == 0); {846#false} is VALID [2022-04-28 09:04:29,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {846#false} is VALID [2022-04-28 09:04:29,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#false} assume #t~switch5; {846#false} is VALID [2022-04-28 09:04:29,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {846#false} is VALID [2022-04-28 09:04:29,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {846#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {846#false} is VALID [2022-04-28 09:04:29,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {846#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {846#false} is VALID [2022-04-28 09:04:29,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {846#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {846#false} is VALID [2022-04-28 09:04:29,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {846#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {846#false} ~j~0 := ~i~0 - 1; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {846#false} #t~short15 := 0 < ~j~0; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {846#false} assume !#t~short15; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {846#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {846#false} #t~short18 := 0 < ~j~0; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {846#false} assume !#t~short18; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {846#false} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {846#false} is VALID [2022-04-28 09:04:29,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {846#false} assume ~start~0 <= ~j~0; {846#false} is VALID [2022-04-28 09:04:29,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {846#false} assume !(1 + (~j~0 - ~start~0) >= 2); {846#false} is VALID [2022-04-28 09:04:29,145 INFO L272 TraceCheckUtils]: 29: Hoare triple {846#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {845#true} is VALID [2022-04-28 09:04:29,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {845#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {845#true} is VALID [2022-04-28 09:04:29,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-28 09:04:29,145 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {845#true} {846#false} #154#return; {846#false} is VALID [2022-04-28 09:04:29,145 INFO L290 TraceCheckUtils]: 33: Hoare triple {846#false} havoc #t~ret20.base, #t~ret20.offset; {846#false} is VALID [2022-04-28 09:04:29,145 INFO L272 TraceCheckUtils]: 34: Hoare triple {846#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {846#false} is VALID [2022-04-28 09:04:29,146 INFO L290 TraceCheckUtils]: 35: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-04-28 09:04:29,146 INFO L290 TraceCheckUtils]: 36: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-04-28 09:04:29,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-04-28 09:04:29,146 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-28 09:04:29,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:29,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795667914] [2022-04-28 09:04:29,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795667914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:29,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836839218] [2022-04-28 09:04:29,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:29,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:29,148 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-28 09:04:29,153 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-28 09:04:29,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:29,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:29,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-28 09:04:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:29,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {845#true} call ULTIMATE.init(); {845#true} is VALID [2022-04-28 09:04:29,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {845#true} is VALID [2022-04-28 09:04:29,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {845#true} assume true; {845#true} is VALID [2022-04-28 09:04:29,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {845#true} {845#true} #158#return; {845#true} is VALID [2022-04-28 09:04:29,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {845#true} call #t~ret24 := main(); {845#true} is VALID [2022-04-28 09:04:29,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {845#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {845#true} is VALID [2022-04-28 09:04:29,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {845#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {845#true} is VALID [2022-04-28 09:04:29,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {845#true} is VALID [2022-04-28 09:04:29,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#true} assume !(~i~1 < 8); {845#true} is VALID [2022-04-28 09:04:29,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {845#true} is VALID [2022-04-28 09:04:29,372 INFO L272 TraceCheckUtils]: 10: Hoare triple {845#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#true} assume !(~str.base == 0 && ~str.offset == 0); {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {845#true} assume #t~switch5; {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {845#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {845#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {845#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {845#true} is VALID [2022-04-28 09:04:29,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {845#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {845#true} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {845#true} ~j~0 := ~i~0 - 1; {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {845#true} #t~short15 := 0 < ~j~0; {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {845#true} assume !#t~short15; {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {845#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {845#true} is VALID [2022-04-28 09:04:29,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {845#true} #t~short18 := 0 < ~j~0; {845#true} is VALID [2022-04-28 09:04:29,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {845#true} assume !#t~short18; {934#(not |parse_expression_list_#t~short18|)} is VALID [2022-04-28 09:04:29,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {934#(not |parse_expression_list_#t~short18|)} assume #t~short18;havoc #t~mem17;havoc #t~short18;#t~post19 := ~j~0;~j~0 := #t~post19 - 1;havoc #t~post19; {846#false} is VALID [2022-04-28 09:04:29,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {846#false} assume ~start~0 <= ~j~0; {846#false} is VALID [2022-04-28 09:04:29,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {846#false} assume !(1 + (~j~0 - ~start~0) >= 2); {846#false} is VALID [2022-04-28 09:04:29,386 INFO L272 TraceCheckUtils]: 29: Hoare triple {846#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {846#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {846#false} assume true; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {846#false} {846#false} #154#return; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {846#false} havoc #t~ret20.base, #t~ret20.offset; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L272 TraceCheckUtils]: 34: Hoare triple {846#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {846#false} ~cond := #in~cond; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {846#false} assume 0 == ~cond; {846#false} is VALID [2022-04-28 09:04:29,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {846#false} assume !false; {846#false} is VALID [2022-04-28 09:04:29,388 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-28 09:04:29,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:29,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836839218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:29,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:29,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-28 09:04:29,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:29,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217735046] [2022-04-28 09:04:29,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217735046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:29,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:29,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887322614] [2022-04-28 09:04:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:29,390 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-28 09:04:29,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:29,390 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-28 09:04:29,412 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-28 09:04:29,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:04:29,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:04:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:04:29,413 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-28 09:04:29,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:29,460 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-28 09:04:29,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:04:29,460 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-28 09:04:29,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:29,461 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-28 09:04:29,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-28 09:04:29,464 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-28 09:04:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-04-28 09:04:29,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-04-28 09:04:29,520 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-28 09:04:29,521 INFO L225 Difference]: With dead ends: 84 [2022-04-28 09:04:29,521 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 09:04:29,521 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-28 09:04:29,522 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-28 09:04:29,522 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-28 09:04:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 09:04:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 09:04:29,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:29,527 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-28 09:04:29,527 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-28 09:04:29,527 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-28 09:04:29,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:29,528 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 09:04:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 09:04:29,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:29,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:29,529 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-28 09:04:29,529 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-28 09:04:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:29,531 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2022-04-28 09:04:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 09:04:29,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:29,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:29,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:29,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:29,531 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-28 09:04:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-04-28 09:04:29,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 38 [2022-04-28 09:04:29,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:29,533 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-04-28 09:04:29,533 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-28 09:04:29,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 59 transitions. [2022-04-28 09:04:29,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-04-28 09:04:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:04:29,573 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:29,573 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-28 09:04:29,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 09:04:29,787 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-28 09:04:29,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1357570032, now seen corresponding path program 1 times [2022-04-28 09:04:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:29,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721287296] [2022-04-28 09:04:29,803 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:29,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1357570032, now seen corresponding path program 2 times [2022-04-28 09:04:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:29,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792896935] [2022-04-28 09:04:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-28 09:04:29,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-28 09:04:29,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-28 09:04:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:04:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {1334#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1334#true} is VALID [2022-04-28 09:04:29,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-28 09:04:29,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1334#true} {1335#false} #154#return; {1335#false} is VALID [2022-04-28 09:04:29,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:29,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-28 09:04:29,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-28 09:04:29,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-28 09:04:29,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret24 := main(); {1334#true} is VALID [2022-04-28 09:04:29,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1339#(= main_~i~1 0)} is VALID [2022-04-28 09:04:29,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1339#(= main_~i~1 0)} is VALID [2022-04-28 09:04:29,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1339#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1340#(<= main_~i~1 1)} is VALID [2022-04-28 09:04:29,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {1340#(<= main_~i~1 1)} assume !(~i~1 < 8); {1335#false} is VALID [2022-04-28 09:04:29,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {1335#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L272 TraceCheckUtils]: 10: Hoare triple {1335#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 11: Hoare triple {1335#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {1335#false} assume !(~str.base == 0 && ~str.offset == 0); {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {1335#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#false} assume #t~switch5; {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {1335#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {1335#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {1335#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1335#false} is VALID [2022-04-28 09:04:29,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {1335#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {1335#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {1335#false} ~j~0 := ~i~0 - 1; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {1335#false} #t~short15 := 0 < ~j~0; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {1335#false} assume !#t~short15; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {1335#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {1335#false} #t~short18 := 0 < ~j~0; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {1335#false} assume !#t~short18; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {1335#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {1335#false} assume ~start~0 <= ~j~0; {1335#false} is VALID [2022-04-28 09:04:29,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L272 TraceCheckUtils]: 29: Hoare triple {1335#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1334#true} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {1334#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1334#true} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 31: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-28 09:04:29,883 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1334#true} {1335#false} #154#return; {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} havoc #t~ret20.base, #t~ret20.offset; {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L272 TraceCheckUtils]: 34: Hoare triple {1335#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 36: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-28 09:04:29,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-28 09:04:29,884 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-28 09:04:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792896935] [2022-04-28 09:04:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792896935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:29,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452879672] [2022-04-28 09:04:29,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:29,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:29,885 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-28 09:04:29,886 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-28 09:04:29,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:29,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:29,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 09:04:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:29,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:30,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2022-04-28 09:04:30,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {1334#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1334#true} is VALID [2022-04-28 09:04:30,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #158#return; {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret24 := main(); {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {1334#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1334#true} assume !(~i~1 < 8); {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {1334#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1334#true} is VALID [2022-04-28 09:04:30,223 INFO L272 TraceCheckUtils]: 10: Hoare triple {1334#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1334#true} is VALID [2022-04-28 09:04:30,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {1334#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-28 09:04:30,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-28 09:04:30,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch5; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {1388#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {1407#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:30,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {1407#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short15 := 0 < ~j~0; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short18 := 0 < ~j~0; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:30,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#(and (<= 1 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L290 TraceCheckUtils]: 28: Hoare triple {1335#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L272 TraceCheckUtils]: 29: Hoare triple {1335#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {1335#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {1335#false} assume true; {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1335#false} {1335#false} #154#return; {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {1335#false} havoc #t~ret20.base, #t~ret20.offset; {1335#false} is VALID [2022-04-28 09:04:30,232 INFO L272 TraceCheckUtils]: 34: Hoare triple {1335#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1335#false} is VALID [2022-04-28 09:04:30,233 INFO L290 TraceCheckUtils]: 35: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2022-04-28 09:04:30,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {1335#false} assume 0 == ~cond; {1335#false} is VALID [2022-04-28 09:04:30,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2022-04-28 09:04:30,233 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-28 09:04:30,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:30,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452879672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:30,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:30,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-28 09:04:30,234 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:30,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721287296] [2022-04-28 09:04:30,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721287296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:30,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:30,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734824109] [2022-04-28 09:04:30,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:30,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-28 09:04:30,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:30,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:30,262 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-28 09:04:30,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:04:30,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:30,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:04:30,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:30,264 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:30,580 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2022-04-28 09:04:30,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:04:30,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-28 09:04:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-28 09:04:30,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 162 transitions. [2022-04-28 09:04:30,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 162 transitions. [2022-04-28 09:04:30,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:30,666 INFO L225 Difference]: With dead ends: 129 [2022-04-28 09:04:30,666 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 09:04:30,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:04:30,667 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:30,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 201 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 09:04:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 56. [2022-04-28 09:04:30,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:30,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:30,695 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:30,696 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:30,698 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 09:04:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 09:04:30,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:30,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:30,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-28 09:04:30,699 INFO L87 Difference]: Start difference. First operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 77 states. [2022-04-28 09:04:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:30,701 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-28 09:04:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-28 09:04:30,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:30,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:30,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:30,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-04-28 09:04:30,703 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2022-04-28 09:04:30,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:30,703 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-04-28 09:04:30,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:30,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 68 transitions. [2022-04-28 09:04:30,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-04-28 09:04:30,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 09:04:30,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:30,757 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-28 09:04:30,777 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-28 09:04:30,967 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-28 09:04:30,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1248453522, now seen corresponding path program 1 times [2022-04-28 09:04:30,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:30,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1278790771] [2022-04-28 09:04:30,973 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:30,973 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:30,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1248453522, now seen corresponding path program 2 times [2022-04-28 09:04:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:30,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616370932] [2022-04-28 09:04:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:30,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:31,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:31,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-28 09:04:31,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-28 09:04:31,027 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-28 09:04:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-04-28 09:04:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:31,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {1988#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1988#true} is VALID [2022-04-28 09:04:31,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-28 09:04:31,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1988#true} {1989#false} #154#return; {1989#false} is VALID [2022-04-28 09:04:31,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:31,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-28 09:04:31,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-28 09:04:31,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-28 09:04:31,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret24 := main(); {1988#true} is VALID [2022-04-28 09:04:31,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1988#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1993#(= main_~i~1 0)} is VALID [2022-04-28 09:04:31,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1993#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1993#(= main_~i~1 0)} is VALID [2022-04-28 09:04:31,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1993#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1994#(<= main_~i~1 1)} is VALID [2022-04-28 09:04:31,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1994#(<= main_~i~1 1)} assume !(~i~1 < 8); {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1989#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L272 TraceCheckUtils]: 10: Hoare triple {1989#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1989#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1989#false} assume !(~str.base == 0 && ~str.offset == 0); {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {1989#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {1989#false} assume #t~switch5; {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {1989#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {1989#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {1989#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {1989#false} is VALID [2022-04-28 09:04:31,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {1989#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {1989#false} assume !(34 == #t~mem10);havoc #t~mem10; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {1989#false} ~j~0 := ~i~0 - 1; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#false} #t~short15 := 0 < ~j~0; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {1989#false} assume !#t~short15; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {1989#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {1989#false} #t~short18 := 0 < ~j~0; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {1989#false} assume !#t~short18; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {1989#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 27: Hoare triple {1989#false} assume ~start~0 <= ~j~0; {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1989#false} is VALID [2022-04-28 09:04:31,045 INFO L272 TraceCheckUtils]: 29: Hoare triple {1989#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1988#true} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {1988#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1988#true} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 31: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-28 09:04:31,046 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1988#true} {1989#false} #154#return; {1989#false} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 33: Hoare triple {1989#false} havoc #t~ret20.base, #t~ret20.offset; {1989#false} is VALID [2022-04-28 09:04:31,046 INFO L272 TraceCheckUtils]: 34: Hoare triple {1989#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1989#false} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 35: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 36: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2022-04-28 09:04:31,046 INFO L290 TraceCheckUtils]: 37: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2022-04-28 09:04:31,046 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-28 09:04:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616370932] [2022-04-28 09:04:31,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616370932] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:31,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584620563] [2022-04-28 09:04:31,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:31,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:31,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:31,049 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:04:31,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 09:04:31,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:31,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:31,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:04:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:31,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:31,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1988#true} call ULTIMATE.init(); {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1988#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {1988#true} assume true; {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1988#true} {1988#true} #158#return; {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {1988#true} call #t~ret24 := main(); {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {1988#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {1988#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {1988#true} is VALID [2022-04-28 09:04:31,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {1988#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {1988#true} is VALID [2022-04-28 09:04:31,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {1988#true} assume !(~i~1 < 8); {1988#true} is VALID [2022-04-28 09:04:31,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {1988#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {1988#true} is VALID [2022-04-28 09:04:31,309 INFO L272 TraceCheckUtils]: 10: Hoare triple {1988#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {1988#true} is VALID [2022-04-28 09:04:31,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {1988#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-28 09:04:31,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} assume !(~str.base == 0 && ~str.offset == 0); {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} is VALID [2022-04-28 09:04:31,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {2035#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume #t~switch5; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} assume !(34 == #t~mem10);havoc #t~mem10; {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} is VALID [2022-04-28 09:04:31,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {2042#(and (<= 0 parse_expression_list_~start~0) (<= parse_expression_list_~i~0 0))} ~j~0 := ~i~0 - 1; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short15 := 0 < ~j~0; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} #t~short18 := 0 < ~j~0; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} is VALID [2022-04-28 09:04:31,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {2064#(and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~j~0 1) 0))} assume ~start~0 <= ~j~0; {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {1989#false} assume !(1 + (~j~0 - ~start~0) >= 2); {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L272 TraceCheckUtils]: 29: Hoare triple {1989#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {1989#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {1989#false} assume true; {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1989#false} {1989#false} #154#return; {1989#false} is VALID [2022-04-28 09:04:31,317 INFO L290 TraceCheckUtils]: 33: Hoare triple {1989#false} havoc #t~ret20.base, #t~ret20.offset; {1989#false} is VALID [2022-04-28 09:04:31,318 INFO L272 TraceCheckUtils]: 34: Hoare triple {1989#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {1989#false} is VALID [2022-04-28 09:04:31,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {1989#false} ~cond := #in~cond; {1989#false} is VALID [2022-04-28 09:04:31,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {1989#false} assume 0 == ~cond; {1989#false} is VALID [2022-04-28 09:04:31,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {1989#false} assume !false; {1989#false} is VALID [2022-04-28 09:04:31,318 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-28 09:04:31,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:31,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584620563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:31,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:31,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-28 09:04:31,319 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:31,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1278790771] [2022-04-28 09:04:31,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1278790771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:31,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:31,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:04:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467750116] [2022-04-28 09:04:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:31,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-28 09:04:31,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:31,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:31,342 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-28 09:04:31,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:04:31,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:31,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:04:31,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:04:31,345 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:31,593 INFO L93 Difference]: Finished difference Result 118 states and 148 transitions. [2022-04-28 09:04:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:04:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-28 09:04:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:31,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-04-28 09:04:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2022-04-28 09:04:31,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 144 transitions. [2022-04-28 09:04:31,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:31,712 INFO L225 Difference]: With dead ends: 118 [2022-04-28 09:04:31,712 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 09:04:31,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:04:31,715 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:31,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 153 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 09:04:31,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-04-28 09:04:31,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:31,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:31,751 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:31,751 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:31,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:31,753 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-28 09:04:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-04-28 09:04:31,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:31,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:31,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-28 09:04:31,753 INFO L87 Difference]: Start difference. First operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 66 states. [2022-04-28 09:04:31,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:31,755 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2022-04-28 09:04:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2022-04-28 09:04:31,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:31,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:31,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:31,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:31,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-04-28 09:04:31,757 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 38 [2022-04-28 09:04:31,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:31,758 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-04-28 09:04:31,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:31,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 61 transitions. [2022-04-28 09:04:31,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:31,799 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-28 09:04:31,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 09:04:31,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:31,799 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:31,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 09:04:32,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:32,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash 237631538, now seen corresponding path program 1 times [2022-04-28 09:04:32,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:32,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [290835162] [2022-04-28 09:04:32,016 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:32,016 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 237631538, now seen corresponding path program 2 times [2022-04-28 09:04:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:32,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884312891] [2022-04-28 09:04:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:32,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-28 09:04:32,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:32,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-28 09:04:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:04:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:32,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {2589#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2589#true} is VALID [2022-04-28 09:04:32,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:32,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2589#true} {2590#false} #154#return; {2590#false} is VALID [2022-04-28 09:04:32,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:32,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {2599#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-28 09:04:32,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:32,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-28 09:04:32,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret24 := main(); {2589#true} is VALID [2022-04-28 09:04:32,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2594#(= main_~i~1 0)} is VALID [2022-04-28 09:04:32,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {2594#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {2594#(= main_~i~1 0)} is VALID [2022-04-28 09:04:32,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {2594#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {2595#(<= main_~i~1 1)} is VALID [2022-04-28 09:04:32,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {2595#(<= main_~i~1 1)} assume !(~i~1 < 8); {2590#false} is VALID [2022-04-28 09:04:32,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {2590#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2590#false} is VALID [2022-04-28 09:04:32,056 INFO L272 TraceCheckUtils]: 10: Hoare triple {2590#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2590#false} is VALID [2022-04-28 09:04:32,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {2590#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {2590#false} assume !(~str.base == 0 && ~str.offset == 0); {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {2590#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {2590#false} assume !#t~switch5; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {2590#false} havoc #t~mem4;havoc #t~switch5; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {2590#false} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {2590#false} assume !!(0 != #t~mem2);havoc #t~mem2; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {2590#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {2590#false} assume #t~switch5; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {2590#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {2590#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2590#false} is VALID [2022-04-28 09:04:32,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {2590#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {2590#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {2590#false} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {2590#false} ~j~0 := ~i~0 - 1; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {2590#false} #t~short15 := 0 < ~j~0; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {2590#false} assume !#t~short15; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {2590#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 29: Hoare triple {2590#false} #t~short18 := 0 < ~j~0; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {2590#false} assume !#t~short18; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {2590#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 32: Hoare triple {2590#false} assume ~start~0 <= ~j~0; {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2590#false} is VALID [2022-04-28 09:04:32,058 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2589#true} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {2589#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2589#true} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:32,059 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2589#true} {2590#false} #154#return; {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {2590#false} havoc #t~ret20.base, #t~ret20.offset; {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L272 TraceCheckUtils]: 39: Hoare triple {2590#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L290 TraceCheckUtils]: 42: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 09:04:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:04:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:32,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884312891] [2022-04-28 09:04:32,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884312891] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:32,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723658900] [2022-04-28 09:04:32,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:32,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:32,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:32,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:04:32,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 09:04:32,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:32,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:32,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 09:04:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:32,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:32,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {2589#true} call ULTIMATE.init(); {2589#true} is VALID [2022-04-28 09:04:32,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {2589#true} is VALID [2022-04-28 09:04:32,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {2589#true} assume true; {2589#true} is VALID [2022-04-28 09:04:32,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2589#true} {2589#true} #158#return; {2589#true} is VALID [2022-04-28 09:04:32,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {2589#true} call #t~ret24 := main(); {2589#true} is VALID [2022-04-28 09:04:32,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {2589#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {2589#true} is VALID [2022-04-28 09:04:32,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {2589#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {2589#true} is VALID [2022-04-28 09:04:32,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {2589#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {2589#true} is VALID [2022-04-28 09:04:32,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {2589#true} assume !(~i~1 < 8); {2589#true} is VALID [2022-04-28 09:04:32,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {2589#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {2589#true} is VALID [2022-04-28 09:04:32,308 INFO L272 TraceCheckUtils]: 10: Hoare triple {2589#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {2589#true} is VALID [2022-04-28 09:04:32,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {2589#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !(~str.base == 0 && ~str.offset == 0); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} havoc #t~mem4;havoc #t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !!(0 != #t~mem2);havoc #t~mem2; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume #t~switch5; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {2636#(<= 0 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {2636#(<= 0 parse_expression_list_~start~0)} assume 34 == #t~mem10;havoc #t~mem10;#t~post11 := ~start~0;~start~0 := 1 + #t~post11;havoc #t~post11; {2676#(<= 1 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {2676#(<= 1 parse_expression_list_~start~0)} ~j~0 := ~i~0 - 1; {2676#(<= 1 parse_expression_list_~start~0)} is VALID [2022-04-28 09:04:32,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {2676#(<= 1 parse_expression_list_~start~0)} #t~short15 := 0 < ~j~0; {2683#(and (<= 1 parse_expression_list_~start~0) (or (and (not (< 0 parse_expression_list_~j~0)) (not |parse_expression_list_#t~short15|)) (and |parse_expression_list_#t~short15| (< 0 parse_expression_list_~j~0))))} is VALID [2022-04-28 09:04:32,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {2683#(and (<= 1 parse_expression_list_~start~0) (or (and (not (< 0 parse_expression_list_~j~0)) (not |parse_expression_list_#t~short15|)) (and |parse_expression_list_#t~short15| (< 0 parse_expression_list_~j~0))))} assume !#t~short15; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-28 09:04:32,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-28 09:04:32,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} #t~short18 := 0 < ~j~0; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-28 09:04:32,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short18; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-28 09:04:32,318 INFO L290 TraceCheckUtils]: 31: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {2687#(and (<= 1 parse_expression_list_~start~0) (<= parse_expression_list_~j~0 0))} assume ~start~0 <= ~j~0; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {2590#false} assume !(1 + (~j~0 - ~start~0) >= 2); {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L272 TraceCheckUtils]: 34: Hoare triple {2590#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {2590#false} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {2590#false} assume true; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2590#false} {2590#false} #154#return; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {2590#false} havoc #t~ret20.base, #t~ret20.offset; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L272 TraceCheckUtils]: 39: Hoare triple {2590#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {2590#false} ~cond := #in~cond; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 41: Hoare triple {2590#false} assume 0 == ~cond; {2590#false} is VALID [2022-04-28 09:04:32,319 INFO L290 TraceCheckUtils]: 42: Hoare triple {2590#false} assume !false; {2590#false} is VALID [2022-04-28 09:04:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:04:32,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:32,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723658900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:32,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2022-04-28 09:04:32,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:32,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [290835162] [2022-04-28 09:04:32,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [290835162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:32,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:32,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:32,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268924126] [2022-04-28 09:04:32,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:32,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-28 09:04:32,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:32,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:32,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:32,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:04:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:32,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:04:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:32,343 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:32,708 INFO L93 Difference]: Finished difference Result 142 states and 185 transitions. [2022-04-28 09:04:32,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:04:32,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-28 09:04:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:32,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-04-28 09:04:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2022-04-28 09:04:32,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 177 transitions. [2022-04-28 09:04:32,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:32,818 INFO L225 Difference]: With dead ends: 142 [2022-04-28 09:04:32,818 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 09:04:32,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-28 09:04:32,819 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 53 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:32,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 205 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:04:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 09:04:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2022-04-28 09:04:32,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:32,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:32,887 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:32,887 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:32,890 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-04-28 09:04:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-04-28 09:04:32,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:32,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:32,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-28 09:04:32,890 INFO L87 Difference]: Start difference. First operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 100 states. [2022-04-28 09:04:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:32,893 INFO L93 Difference]: Finished difference Result 100 states and 130 transitions. [2022-04-28 09:04:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2022-04-28 09:04:32,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:32,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:32,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:32,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 63 states have internal predecessors, (83), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:32,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-04-28 09:04:32,895 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 43 [2022-04-28 09:04:32,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:32,895 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-04-28 09:04:32,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:32,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 91 transitions. [2022-04-28 09:04:32,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:32,963 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-28 09:04:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 09:04:32,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:32,964 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:32,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 09:04:33,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:33,179 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:33,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312204, now seen corresponding path program 1 times [2022-04-28 09:04:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:33,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003872358] [2022-04-28 09:04:33,185 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-28 09:04:33,185 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:04:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1451312204, now seen corresponding path program 2 times [2022-04-28 09:04:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:33,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781177276] [2022-04-28 09:04:33,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:33,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-28 09:04:33,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-28 09:04:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-28 09:04:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:33,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-28 09:04:33,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3362#true} {3363#false} #154#return; {3363#false} is VALID [2022-04-28 09:04:33,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} call ULTIMATE.init(); {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:33,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {3372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-28 09:04:33,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-28 09:04:33,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} call #t~ret24 := main(); {3362#true} is VALID [2022-04-28 09:04:33,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3367#(= main_~i~1 0)} is VALID [2022-04-28 09:04:33,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {3367#(= main_~i~1 0)} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {3367#(= main_~i~1 0)} is VALID [2022-04-28 09:04:33,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {3367#(= main_~i~1 0)} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {3368#(<= main_~i~1 1)} is VALID [2022-04-28 09:04:33,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {3368#(<= main_~i~1 1)} assume !(~i~1 < 8); {3363#false} is VALID [2022-04-28 09:04:33,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {3363#false} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3363#false} is VALID [2022-04-28 09:04:33,241 INFO L272 TraceCheckUtils]: 10: Hoare triple {3363#false} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3363#false} is VALID [2022-04-28 09:04:33,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {3363#false} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3363#false} is VALID [2022-04-28 09:04:33,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {3363#false} assume !(~str.base == 0 && ~str.offset == 0); {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {3363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {3363#false} assume !#t~switch5; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {3363#false} havoc #t~mem4;havoc #t~switch5; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {3363#false} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {3363#false} assume !!(0 != #t~mem2);havoc #t~mem2; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {3363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {3363#false} assume #t~switch5; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {3363#false} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {3363#false} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {3363#false} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {3363#false} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {3363#false} assume !(34 == #t~mem10);havoc #t~mem10; {3363#false} is VALID [2022-04-28 09:04:33,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {3363#false} ~j~0 := ~i~0 - 1; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 26: Hoare triple {3363#false} #t~short15 := 0 < ~j~0; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {3363#false} assume !#t~short15; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {3363#false} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {3363#false} #t~short18 := 0 < ~j~0; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {3363#false} assume !#t~short18; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {3363#false} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {3363#false} assume ~start~0 <= ~j~0; {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {3363#false} assume !(1 + (~j~0 - ~start~0) >= 2); {3363#false} is VALID [2022-04-28 09:04:33,243 INFO L272 TraceCheckUtils]: 34: Hoare triple {3363#false} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3362#true} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 35: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-28 09:04:33,243 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,243 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3362#true} {3363#false} #154#return; {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {3363#false} havoc #t~ret20.base, #t~ret20.offset; {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L272 TraceCheckUtils]: 39: Hoare triple {3363#false} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {3363#false} ~cond := #in~cond; {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {3363#false} assume 0 == ~cond; {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} assume !false; {3363#false} is VALID [2022-04-28 09:04:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 09:04:33,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:33,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781177276] [2022-04-28 09:04:33,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781177276] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:04:33,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140040324] [2022-04-28 09:04:33,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:04:33,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:33,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:33,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 09:04:33,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 09:04:33,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 09:04:33,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:04:33,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 09:04:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:33,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:04:33,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {3362#true} call ULTIMATE.init(); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {3362#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3362#true} {3362#true} #158#return; {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {3362#true} call #t~ret24 := main(); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {3362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(9);~i~1 := 0; {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {3362#true} assume !!(~i~1 < 8);assume -128 <= #t~nondet22 && #t~nondet22 <= 127;call write~int(#t~nondet22, ~#A~0.base, ~#A~0.offset + ~i~1, 1);havoc #t~nondet22; {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#true} #t~post21 := ~i~1;~i~1 := 1 + #t~post21;havoc #t~post21; {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#true} assume !(~i~1 < 8); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {3362#true} call write~int(0, ~#A~0.base, 8 + ~#A~0.offset, 1); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L272 TraceCheckUtils]: 10: Hoare triple {3362#true} call #t~ret23 := parse_expression_list(~#A~0.base, ~#A~0.offset); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {3362#true} ~str.base, ~str.offset := #in~str.base, #in~str.offset;~start~0 := 0;~i~0 := -1;~j~0 := -1;call ~#str2~0.base, ~#str2~0.offset := #Ultimate.allocOnStack(2); {3362#true} is VALID [2022-04-28 09:04:33,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {3362#true} assume !(~str.base == 0 && ~str.offset == 0); {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {3362#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#true} assume !#t~switch5; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#true} havoc #t~mem4;havoc #t~switch5; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#true} call #t~mem2 := read~int(~str.base, ~str.offset + ~i~0, 1); {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#true} assume !!(0 != #t~mem2);havoc #t~mem2; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3;call #t~mem4 := read~int(~str.base, ~str.offset + ~i~0, 1);#t~switch5 := 0 == #t~mem4; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {3362#true} assume #t~switch5; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {3362#true} call #t~mem6 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 32 == #t~mem6; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {3362#true} assume !#t~short8;call #t~mem7 := read~int(~str.base, ~str.offset + ~start~0, 1);#t~short8 := 9 == #t~mem7; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#true} assume !#t~short8;havoc #t~mem6;havoc #t~mem7;havoc #t~short8; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {3362#true} call #t~mem10 := read~int(~str.base, ~str.offset + ~start~0, 1); {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {3362#true} assume !(34 == #t~mem10);havoc #t~mem10; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {3362#true} ~j~0 := ~i~0 - 1; {3362#true} is VALID [2022-04-28 09:04:33,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {3362#true} #t~short15 := 0 < ~j~0; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {3362#true} assume !#t~short15; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {3362#true} assume !#t~short15;havoc #t~mem12;havoc #t~mem13;havoc #t~short14;havoc #t~short15; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {3362#true} #t~short18 := 0 < ~j~0; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {3362#true} assume !#t~short18; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {3362#true} assume !#t~short18;havoc #t~mem17;havoc #t~short18; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {3362#true} assume ~start~0 <= ~j~0; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {3362#true} assume !(1 + (~j~0 - ~start~0) >= 2); {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-28 09:04:33,420 INFO L272 TraceCheckUtils]: 34: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} call #t~ret20.base, #t~ret20.offset := r_strncpy(~#str2~0.base, ~#str2~0.offset, ~str.base, ~str.offset + ~start~0, 1 + (~j~0 - ~start~0)); {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 35: Hoare triple {3362#true} ~dest.base, ~dest.offset := #in~dest.base, #in~dest.offset;~src.base, ~src.offset := #in~src.base, #in~src.offset;~n := #in~n;call #t~ret1.base, #t~ret1.offset := strncpy(~dest.base, ~dest.offset, ~src.base, ~src.offset, ~n);#res.base, #res.offset := #t~ret1.base, #t~ret1.offset;havoc #t~ret1.base, #t~ret1.offset; {3362#true} is VALID [2022-04-28 09:04:33,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {3362#true} assume true; {3362#true} is VALID [2022-04-28 09:04:33,421 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3362#true} {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} #154#return; {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-28 09:04:33,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} havoc #t~ret20.base, #t~ret20.offset; {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} is VALID [2022-04-28 09:04:33,422 INFO L272 TraceCheckUtils]: 39: Hoare triple {3475#(not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0))} call __VERIFIER_assert((if 1 + (~j~0 - ~start~0) < 2 then 1 else 0)); {3494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:04:33,423 INFO L290 TraceCheckUtils]: 40: Hoare triple {3494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 09:04:33,423 INFO L290 TraceCheckUtils]: 41: Hoare triple {3498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3363#false} is VALID [2022-04-28 09:04:33,423 INFO L290 TraceCheckUtils]: 42: Hoare triple {3363#false} assume !false; {3363#false} is VALID [2022-04-28 09:04:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 09:04:33,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 09:04:33,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140040324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:33,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 09:04:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-28 09:04:33,424 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:33,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003872358] [2022-04-28 09:04:33,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003872358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:33,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:33,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 09:04:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428229223] [2022-04-28 09:04:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:33,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-28 09:04:33,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:33,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:33,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:33,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 09:04:33,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:33,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 09:04:33,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 09:04:33,446 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:33,649 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-28 09:04:33,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:04:33,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-04-28 09:04:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:33,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 09:04:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 09:04:33,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 09:04:33,697 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-28 09:04:33,697 INFO L225 Difference]: With dead ends: 73 [2022-04-28 09:04:33,697 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:04:33,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:33,698 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:33,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 161 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:33,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:04:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:04:33,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:33,699 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-28 09:04:33,699 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-28 09:04:33,699 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-28 09:04:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:33,699 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:33,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:33,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:33,700 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-28 09:04:33,700 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-28 09:04:33,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:33,700 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:33,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:33,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:33,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:33,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:33,700 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-28 09:04:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:04:33,700 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2022-04-28 09:04:33,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:33,700 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:04:33,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 09:04:33,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:04:33,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:33,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:33,703 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:04:33,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 09:04:33,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:04:33,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:04:34,074 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-28 09:04:34,074 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-28 09:04:34,074 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-28 09:04:34,074 INFO L902 garLoopResultBuilder]: At program point r_strncpyFINAL(line 42) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point r_strncpyEXIT(line 42) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point r_strncpyENTRY(line 42) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 87 96) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L94-1(line 94) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 87 96) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L90-2(lines 90 92) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L90-3(lines 90 92) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L90-4(lines 90 92) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 87 96) the Hoare annotation is: true [2022-04-28 09:04:34,075 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-28 09:04:34,075 INFO L895 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L73(lines 73 75) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L65(lines 65 83) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,075 INFO L902 garLoopResultBuilder]: At program point L70-2(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L70-4(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L70-6(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point parse_expression_listFINAL(lines 58 86) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L895 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: (and (<= 0 parse_expression_list_~start~0) (<= (+ parse_expression_list_~i~0 1) 0) (<= (+ parse_expression_list_~j~0 1) 0)) [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L70-8(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L70-9(line 70) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point parse_expression_listENTRY(lines 58 86) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L71-2(line 71) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L71-4(lines 65 83) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L67-3(line 67) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L67-5(line 67) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L63-1(lines 63 84) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L67-6(line 67) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L63-2(lines 63 84) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point parse_expression_listEXIT(lines 58 86) the Hoare annotation is: true [2022-04-28 09:04:34,076 INFO L902 garLoopResultBuilder]: At program point L63-4(lines 63 84) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point L63-5(lines 63 84) the Hoare annotation is: true [2022-04-28 09:04:34,077 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-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point L72(lines 72 81) the Hoare annotation is: (not (<= (+ parse_expression_list_~start~0 1) parse_expression_list_~j~0)) [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point L68-2(line 68) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 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-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:04:34,077 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 19) the Hoare annotation is: true [2022-04-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:04:34,077 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 19) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 09:04:34,078 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 09:04:34,080 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-28 09:04:34,081 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:04:34,083 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:04:34,083 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:04:34,084 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-28 09:04:34,089 INFO L163 areAnnotationChecker]: CFG has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:04:34,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:04:34 BoogieIcfgContainer [2022-04-28 09:04:34,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:04:34,095 INFO L158 Benchmark]: Toolchain (without parser) took 7040.14ms. Allocated memory was 199.2MB in the beginning and 267.4MB in the end (delta: 68.2MB). Free memory was 151.9MB in the beginning and 189.4MB in the end (delta: -37.5MB). Peak memory consumption was 31.0MB. Max. memory is 8.0GB. [2022-04-28 09:04:34,096 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 199.2MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:04:34,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.57ms. Allocated memory is still 199.2MB. Free memory was 151.7MB in the beginning and 175.3MB in the end (delta: -23.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-28 09:04:34,096 INFO L158 Benchmark]: Boogie Preprocessor took 40.20ms. Allocated memory is still 199.2MB. Free memory was 175.3MB in the beginning and 173.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:04:34,096 INFO L158 Benchmark]: RCFGBuilder took 393.45ms. Allocated memory is still 199.2MB. Free memory was 173.2MB in the beginning and 154.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-04-28 09:04:34,096 INFO L158 Benchmark]: TraceAbstraction took 6332.33ms. Allocated memory was 199.2MB in the beginning and 267.4MB in the end (delta: 68.2MB). Free memory was 154.4MB in the beginning and 189.4MB in the end (delta: -35.1MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2022-04-28 09:04:34,097 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 199.2MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 270.57ms. Allocated memory is still 199.2MB. Free memory was 151.7MB in the beginning and 175.3MB in the end (delta: -23.6MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.20ms. Allocated memory is still 199.2MB. Free memory was 175.3MB in the beginning and 173.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 393.45ms. Allocated memory is still 199.2MB. Free memory was 173.2MB in the beginning and 154.9MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 6332.33ms. Allocated memory was 199.2MB in the beginning and 267.4MB in the end (delta: 68.2MB). Free memory was 154.4MB in the beginning and 189.4MB in the end (delta: -35.1MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 282 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 956 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 597 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 416 IncrementalHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 359 mSDtfsCounter, 416 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 65 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 171 PreInvPairs, 276 NumberOfFragments, 126 HoareAnnotationTreeSize, 171 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 55 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 58]: Procedure Contract for parse_expression_list Derived contract for procedure parse_expression_list: 1 - ProcedureContractResult [Line: 42]: Procedure Contract for r_strncpy Derived contract for procedure r_strncpy: 1 - ProcedureContractResult [Line: 87]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 09:04:34,121 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...